An LR (1) parser is a finite-state automaton, equipped with a stack, which uses a
combination of its current state and one lookahead symbol in order to determine which …

We present a Hoare logic for a call-by-value programming language equipped with
recursive, higher-order functions, algebraic data types, and a polymorphic type system in the …

Stratified type inference for generalized algebraic data types Page 1 Stratified Type Inference
For Generalized Algebraic Data Types François Pottier Yann Régis-Gianas INRIA …

We report on the experience of develo** Merlin, a language server for the OCaml
programming language in development since 2013. Merlin is a daemon that connects to …

General-purpose programming languages typically define literal notation for only a small
number of common data structures, like lists. This is unsatisfying because there are many …

Ziggurat is a meta-language system that permits programmers to develop Scheme-like
macros for languages with nontrivial static semantics, such as C or Java (suitably encoded …

We hope this paper stimulates a discussion about the future of functional programming
languages. To start that discussion we make a concrete proposal. We explore a new point in …

Compiler development has been one of the leading computer research subjects. This field of
study aims to understand the link between computer systems and computer languages …

Guarded recursive data types (GRDTs) are a new language feature which allows to type
check the different branches of case expressions under different type assumptions. We …

GADTs are a modest extension to datatypes which support static ty** of a larger class of
programs than those possible with standard datatypes. However, programming languages …