Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Barendregt, H.P.: The lambda calculus: Its syntax and semantics. North-Holland Publishing Co., Amsterdam (1984)
2. Bastonero, O., Gouy, X.: Strong stability and the incompleteness of stable models of λ-calculus. Annals of Pure and Applied Logic 100, 247–277 (1999)
3. Berline, C.: From computation to foundations via functions and application: The λ-calculus and its webbed models. Theoretical Computer Science 249, 81–161 (2000)
4. Berline, C., Manzonetto, G., Salibra, A.: Effective λ-models versus recursively enumerable λ-theories. Math. Struct. Comp. Science 19, 897–942 (2009)
5. Lecture Notes in Computer Science;G. Berry,1978