A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoret. Comput. Sci., 121:71-88, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Collapsing Partial Combinatory Algebras - Bethke, Klop (1996) (4 citations) (Correct)
....some elements a; a 0 of A, one may ask whether there exists a homomorphic image OE(A) such that OE(a) OE(a 0 ) XXXXX Xz : A a 0 a OE(A) We shall call such a homomorphic image a collapse. There exist several investigations into collapses of ca s (cf. e.g. Jac75] JZ85] [BI93]) Here the leading question is whether, given terms M and N , the equation M = N can be added consistently to the calculus. Considerations of collapses of nca s seem to be rare. In fact, we do not know of any. In the present note, we address this last theme. Instead of considering collapses, ....
A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoretical Computer Science, 121:71--88, 1993.
SN Combinators and Partial Combinatory Algebras - Akama (Correct)
....A to a pca. 3. A collapse : A B of A is called final, if for all collapses 0 of A there exists a unique homomorphism with ffi 0 = We call B the finally collapsed pca of A. The final collapse of ca s is investigated by Jacopini[14] Jacopini Zilli[15] and Berarducci Intrigila[4]. Here the leading question is whether given terms M and N , the equation M = N can be added consistently to the calculus. Not every extensional ca has a final collapse (Jacopini[14] However, every non total pca has a final collapse [6] Definition 8 (Observational Equivalence on A) Let A ....
A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. TCS, 121:71--88, 1993.
SN Combinators and Partial Combinatory Algebras - Yohji Akama (Correct)
....from A to a pca. 3. A collapse : A B of A is called final, if for all collapse 0 of A there exists a unique homomorphism with ffi 0 = We call B the finally collapsed pca of A. The collapse of ca s is investigated by Jacopini[10] Jacopini Zilli[11] and BerarducciIntrigila [3]. Here the leading question is whether given terms M and N , the equation M = N can be added consistently to the calculus. Not every extensional ca has a final collapse (Jacopini[10] However, Theorem 7 (Bethke Klop[5] Given an nca A = hA; 1; s; ki, the quotient structure A= A , which is ....
A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoretical Computer Science, 121:71--88, 1993.
Infinite lambda-calculus and Types - Berarducci, Dezani-Ciancaglini (1998) Self-citation (Berarducci) (Correct)
....time by Kennaway, Klop, Sleep, and de Vries (see [31] with some differences reflecting the different motivations, as we will explain in the following. In October 1994 Berarducci met Klop in Pisa on occasion of a talk Klop gave on the infinite calculus. Motivated by previous work with Intrigila [9], Berarducci was mainly interested in applications of infinite calculus to the study of the properties of unsolvable terms in the classical calculus. In particular he defined a special class of unsolvable terms which he called mute and argued that the mute terms should be considered the terms ....
Berarducci A., Intrigila B., "Some New Results on Easy Lambda-terms", Theor. Comp. Sci. 121, 1993, 71-88. 50
Filter Models and Easy Terms - F.Alessi, Dezani-Ciancaglini, Honsell (2001) (1 citation) (Correct)
No context found.
A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoret. Comput. Sci., 121:71-88, 1993.
Simple Easy Terms - Alessi, Lusin (2002) (Correct)
No context found.
A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoret. Comput. Sci., 121:71-88, 1993.
Simple Easy Terms - Alessi, Lusin (2002) (Correct)
No context found.
A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoret. Comput. Sci., 121:71--88, 1993.
Filter Models and Easy Terms - Alessi, Dezani-Ciancaglini, Honsell (2001) (1 citation) (Correct)
No context found.
A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoret. Comput. Sci., 121:71-88, 1993.
A Continuum of Theories of Lambda Calculus Without Semantics - Antonino Salibra.. (2001) (Correct)
No context found.
A. Berarducci and B. Intrigila, "Some new results on easy lambda-terms", Theoretical Computer Science 121 (1993), pp. 71-88
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