Write a Blog >>
ICFP 2016
Sun 18 - Sat 24 September 2016 Nara, Japan
Tue 20 Sep 2016 11:50 - 12:15 at Noh Theater - Session 5 Chair(s): Robby Findler

Datalog may be considered either an unusually powerful query language or a
carefully limited logic programming language. Datalog is declarative,
expressive, and optimizable, and has been applied successfully in a wide
variety of problem domains. However, most use-cases require extending Datalog
in an application-specific manner. In this paper we define Datafun, an
analogue of Datalog supporting higher-order functional programming. The key
idea is to track monotonicity with types.

Tue 20 Sep

Displayed time zone: Osaka, Sapporo, Tokyo change

10:35 - 12:15
Session 5Research Papers at Noh Theater
Chair(s): Robby Findler Northwestern University
10:35
25m
Talk
A Glimpse of Hopjs
Research Papers
Manuel Serrano Inria, France, Vincent Prunet Inria, France
DOI
11:00
25m
Talk
Experience Report: Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms
Research Papers
Ilya Sergey University College London, UK
DOI
11:25
25m
Talk
Think Like a Vertex, Behave Like a Function! A Functional DSL for Vertex-Centric Big Graph Processing
Research Papers
Kento Emoto Kyushu Institute of Technology, Japan, Kiminori Matsuzaki Kochi University of Technology, Japan, Zhenjiang Hu National Institute of Informatics, Japan, Akimasa Morihata University of Tokyo, Japan, Hideya Iwasaki University of Electro-Communications, Japan
DOI
11:50
25m
Talk
Datafun: A Functional Datalog
Research Papers
Michael Arntzenius University of Birmingham, UK, Neel Krishnaswami University of Birmingham, UK
DOI