JFP 2017
27 papers
- A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading
- A simple library implementation of binary sessions
- Algebraic data integration
- An algebra for distributed Big Data analytics
- Backtracking with cut via a distributive law and left-zero monoids
- Call-by-name extensionality and confluence
- Capability-based localization of distributed and heterogeneous queries
- Compiling a 50-year journey
- Computation semantics of the functional scientific workflow language Cuneiform
- Contributions to a computational theory of policy advice and avoidability
- Correctness of compiling polymorphism to dynamic typing
- Fair enumeration combinators
- Finiteness and rational sequences, constructively
- Flexible dynamic information flow control in the presence of exceptions
- Higher order symbolic execution for contract verification and refutation
- Interactive programming in Agda - Objects and graphical user interfaces
- Modular, higher order cardinality analysis in theory and practice
- No value restriction is needed for algebraic effects and handlers
- Normal-order reduction grammars
- Notions of computation as monoids
- PhD Abstracts
- PhD Abstracts
- Programming with ornaments
- Quick specifications for the busy programmer
- Special issue on Programming with Dependent Types Editorial
- The calculus of dependent lambda eliminations
- The essence of ornaments