A unification algorithm for typed λ-calculus
نویسندگان
چکیده
منابع مشابه
Intersection Typed λ - calculus
The aim of this paper is to discuss the design of an explicitly typed λ-calculus corresponding to the Intersection Type Assignment System (IT ), which assigns intersection types to the untyped λ-calculus. Two different proposals are given. The logical foundation of all of them is the Intersection Logic IL.
متن کاملIntersection Typed λ - calculus Simona Ronchi
The aim of this paper is to discuss the design of an explicitly typed λ-calculus corresponding to the Intersection Type Assignment System (IT ), which assigns intersection types to the untyped λ-calculus. Two different proposals are given. The logical foundation of all of them is the Intersection Logic IL.
متن کاملRealizing the Dependently Typed Λ-calculus
Dependently typed λ-calculi such as the Edinburgh Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the system is based on such an interpretation of LF. We have considered whether a conventional logic programming language can also p...
متن کاملA bigraphical model of the simply typed λ-calculus
We present a model of the simply typed λ-calculus as a simply typed explicit substitution calculus encoded in a bigraphical reactive system. The reactive system combines a previous model by Milner with a sorting of the place graph structure which is defined using a generalisation of our previous work on kind sortings. The model demonstrates the expressiveness of these sortings. We identify some...
متن کاملA Typed Pattern Calculus
The theory of programming with pattern-matching function deenitions has been studied mainly in the framework of rst-order rewrite systems. We present a typed functional calculus that emphasizes the strong connection between the structure of whole pattern deenitions and their types. In this calculus type-checking guarantees the absence of runtime errors caused by non-exhaustive pattern-matching ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1975
ISSN: 0304-3975
DOI: 10.1016/0304-3975(75)90011-0