On the Jacopini Technique

Information and Computation

Volumn 138, Issue 2, 1997, Pages 101-123

  Kuper, Jan ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004095513     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2655     Document Type: Article

References (14)

1. Baeten, J., and Boerboom, B. (1979), Ω can be anything it should not be, Indag. Math. 41, 111-120.
2. Barendregt, H. P. (1984), "The Lambda Calculus - Its Syntax and Semantics," rev. ed., North-Holland, Amsterdam.
3. Berarducci, A., and Intrigila, B. (1993), Some new results on easy lambda terms, Theoret. Comput. Sci. 121, 71-88.
4. Berry, G., Curien, P.-L., and Lévy, J.-J. (1985), Full abstraction for sequential languages: state of the art, in "Algebraic Methods in Semantics" (M. Nivat and J. C. Reynolds, Eds.), pp. 89-132, Cambridge University Press, Cambridge, UK.
5. Intrigila, B. (1991), A problem on easy terms in lambda calculus, Fund. Inform. 15, 99-106.
6. Jacopini, G. (1975), A condition for identifying two elements of whatever model of combinatory logic, in "Lambda Calculus and Computer Science" (C. Böhm, Ed.), pp. 213-219, Springer-Verlag, Berlin.
7. Jacopini, G. (1994), personal communication, Enschede, The Netherlands.
8. Jacopini, G., and Venturini Zilli, M. (1978), "Equating for Recurrent Terms of Lamda Calculus and Combinatory Logic," Quaderni IAC, Serie III, Vol. 85, Istituto per le Applicazioni del Calcolo "Mauro Picone," Rome.
9. Jacopini, G., and Venturini Zilli, M. (1985), Easy terms in the lambda calculus, Fund Inform. 80.
10. Klop, J. W. (1980), "Combinatory Reduction Systems," Ph.D. Thesis, Mathematical Centre, Amsterdam.
11. Mitchell, J. C. (1996), "Foundations for Programming Languages," MIT Press, Cambridge, MA.
12. Plotkin, G. D. (1977), LCF considered as a programming language, Theoret. Comput. Sci. 5, 223-255.
13. van Raamsdonk, F. (1992), "A Simple Proof of Confluence for Weakly Orthogonal Combinatory Reduction Systems," Report CS-R9234, Centre for Mathematics and Computer Science, Amsterdam.
14. Statman, R. (1986), Solving functional equations at higher types: Some examples and some theorems, Notre Dame J. Formal Logic 27, 66-74.