Author:
Böhm Corrado,Piperno Adolfo,Guerrini Stefano
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. S. Abramsky, C.-H.L. Ong, Full Abstraction in the Lazy Lambda Calculus, Technical Report 259, Cambridge University Computer Laboratory, 1992, 105 pp. To appear in Info. and Comp.
2. L.Augustsson and T.Johnsson, The Chalmers Lazy-ML Compiler, The Computer Journal, vol. 32, no. 2, April 1989.
3. J. Backus, Can programming be liberated from vonNeumann style? A functional style and its algebra of programs, ACM Comm., 1978, vol. 21, no. 8, pp. 613–641.
4. H.P.Barendregt, The type free lambda-calculus, in: Handbook of Mathematical Logic, Barwise (ed.), North Holland, 1981, pp.1092–1132.
5. LNCS 702;A. Berarducci,1992
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Encoding the Factorisation Calculus;Electronic Proceedings in Theoretical Computer Science;2015-08-26
2. Church Encoding of Data Types Considered Harmful for Implementations;Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages;2014-10
3. The untyped stack calculus and Bohm's theorem;Electronic Proceedings in Theoretical Computer Science;2013-03-28
4. Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem;Certified Programs and Proofs;2011
5. A CuCh Interpretation of an Object-Oriented Language1 1Partially supported by MURST Cofin '99 TOSCA.;Electronic Notes in Theoretical Computer Science;2001-08