The converse principal type-scheme theorem in lambda calculus

Studia Logica 51 (1):83 - 95 (1992)
Abstract
A principal type-scheme of a -term is the most general type-scheme for the term. The converse principal type-scheme theorem (J.R. Hindley, The principal typescheme of an object in combinatory logic, Trans. Amer. Math. Soc. 146 (1969) 29–60) states that every type-scheme of a combinatory term is a principal type-scheme of some combinatory term.This paper shows a simple proof for the theorem in -calculus, by constructing an algorithm which transforms a type assignment to a -term into a principal type assignment to another -term that has the type as its principal type-scheme. The clearness of the algorithm is due to the characterization theorem of principal type-assignment figures. The algorithm is applicable to BCIW--terms as well. Thus a uniform proof is presented for the converse principal type-scheme theorem for general -terms and BCIW--terms.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370332
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 25,751
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
What is the Type-1/Type-2 Distinction?Nick Chater - 1997 - Behavioral and Brain Sciences 20 (1):68-69.
New Directions in Type-Theoretic Grammars.Reinhard Muskens - 2010 - Journal of Logic, Language and Information 19 (2):129-136.
Storage Operators and Directed Lambda-Calculus.René David & Karim Nour - 1995 - Journal of Symbolic Logic 60 (4):1054-1086.
The Proofs of Α→Α in P - W.Sachio Hirokawa - 1996 - Journal of Symbolic Logic 61 (1):195-211.
Resolution Calculus for the First Order Linear Logic.Grigori Mints - 1993 - Journal of Logic, Language and Information 2 (1):59-83.
A Lambda Proof of the P-W Theorem.Sachio Hirokawa, Yuichi Komori & Misao Nagayama - 2000 - Journal of Symbolic Logic 65 (4):1841-1849.
Compact Bracket Abstraction in Combinatory Logic.Sabine Broda & Luís Damas - 1997 - Journal of Symbolic Logic 62 (3):729-740.

Monthly downloads

Added to index

2009-01-28

Total downloads

11 ( #389,639 of 2,146,889 )

Recent downloads (6 months)

1 ( #385,700 of 2,146,889 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums