G. Pottinger, A type assignment for the strongly normalizable #-terms, In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.R. Hindley and J.P. Seldin, Eds.), Academic Press (####) 561-577. 15 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On Type Inference - In The Intersection (Correct)
No context found.
G. Pottinger, A type assignment for the strongly normalizable #-terms, In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.R. Hindley and J.P. Seldin, Eds.), Academic Press (####) 561-577. 15
On Type Inference in the - Intersection Type Discipline (Correct)
No context found.
G. Pottinger, A type assignment for the strongly normalizable #-terms, In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.R. Hindley and J.P. Seldin, Eds.), Academic Press (1980) 561-577.
Reducibility: a ubiquitous method in lambda calculus with.. - Ghilezan, al. (2002) (Correct)
No context found.
Pottinger, G., A type assignment for the strongly normalizable #-terms, in: J. Seldin and J. Hindley, editors, To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, Academic Press, London, 1980 pp. 561--577.
Compositional Characterisations of λ-terms.. -.. (2005) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable #-terms. In J.R. Hindley and J.P. Seldin, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561--577. Academic Press, London, 1980.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Pottinger, G., \A Type Assignment for the Strongly Normalizable -terms", in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, J.P. Seldin and J.R. Hindley, eds., pp 561-577, Academic Press, 1980.
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (5 citations) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable #-terms. In Hindley and Seldin [13].
Intersection Types, λ-models, and Böhm Trees - Dezani-Ciancaglini.. (Correct)
No context found.
G. Pottinger "A Type Assignment for Strongly Normalizable -terms", To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, 561-577.
A Bargain for Intersection Types: A Simple Strong Normalization.. - Neergaard (Correct)
No context found.
Pottinger, Garrel. (1980). A type assignment for the strongly normalizable #-terms. Pages 561--577 of: Hindley, J. R., & Seldin, J. P. (eds), To H. B. Curry: Essays on combinatory logic, lambda calculus, and formalism. Academic Press.
Beta-Reduction As Unification - Kfoury (1996) (8 citations) (Correct)
No context found.
Pottinger, G., \A Type Assignment for the Strongly Normalizable -terms", in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, J.P. Seldin and J.R. Hindley, eds., pp 561-577, Academic Press, 1980.
Intersection Typed λ-calculus - Rocca (2002) (Correct)
No context found.
Pottinger G.,\A type assignment for the strongly normalizable - terms", in: To H. B. Curry: essays on combinatory logic, lambda calculus and formalism,Academic Press, London, (1980), pp.561-577.
The Essence of Principal Typings - Wells (2002) (51 citations) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable #-terms. In Hindley and Seldin
Approximation Theorems for Intersection Type - Dezani-Ciancaglini Honsell.. (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable -terms. In J.R. Hindley and J.P. Seldin, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561--577. Academic Press, London, 1980.
Filter Models and Easy Terms - F.Alessi, Dezani-Ciancaglini, Honsell (2001) (1 citation) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable -terms. In R.Hindley and J.Seldin, editors, To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, pages 561-577. Academic Press, London, 1980.
New Notions of Reduction and Non-Semantic Proofs of Strong.. - Kfoury, Wells (1995) (20 citations) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable -terms. In Seldin and Hindley [SH80], pp. 561--577.
A Lambda Model Characterizing Computational Behaviours of.. - Dezani-Ciancaglini.. (Correct)
No context found.
Garrel Pottinger. A type assignment for the strongly normalizable -terms. In To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, pages 561--577. Academic Press, London, 1980.
Simple Easy Terms - Alessi, Lusin (2002) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable -terms. In R.Hindley and J.Seldin, editors, To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, pages 561-577. Academic Press, London, 1980.
Exact Intersection Typing Inference and Call-by-Name.. - Adam Bakewell Sebastien (2004) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable #-terms. In Hindley and Seldin [10], pp. 561--577.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
Pottinger, G., \A Type Assignment for the Strongly Normalizable -terms", in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, J.P. Seldin and J.R. Hindley, eds., pp 561-577, Academic Press, 1980.
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (2004) (5 citations) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable #-terms. In Hindley and Seldin [17].
Type Preorders and Recursive Terms - Alessi, Dezani-Ciancaglini (2004) (Correct)
No context found.
Garrel Pottinger. A type assignment for the strongly normalizable #-terms. In J.P. Seldin and J.R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561--577. Academic Press, London, 1980. 17
Principality and Decidable Type Inference for Finite-Rank.. - Kfoury, Wells (1998) (19 citations) (Correct)
No context found.
G. Pottinger. A type assignment for the strongly normalizable -terms. In Seldin and Hindley [SH80], pp. 561--577.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Pottinger, G., "A Type Assignment for the Strongly Normalizable -terms", in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism,J.P. Seldin and J.R. Hindley, eds., pp 561-577, Academic Press, 1980.
Theory and Implementation of an Efficient Tactic-Based Logical.. - Nogin (2002) (Correct)
No context found.
Garrel Pottinger. A type assignment for the strongly normalizable #-terms. In Jonathan P. Seldin and J. Roger Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pages 561--577. Academic Press, London, 1980.
Intersection Typed λ-calculus - Rocca (2002) (Correct)
No context found.
Pottinger G.,"A type assignment for the strongly normalizable #- terms", in: To H. B. Curry: essays on combinatory logic, lambda calculus and formalism,Academic Press, London, (1980), pp.561-577.
On Type Inference in the Intersection Type Discipline - Boudol, Zimmer (2004) (3 citations) (Correct)
No context found.
G. Pottinger, A type assignment for the strongly normalizable #-terms, In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.R. Hindley and J.P. Seldin, Eds.), Academic Press (####) 561-577. 15
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC