' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...