The fixed point property and a technique to harness double fixed point combinators
暂无分享,去创建一个
Giulio Manzonetto | Jakob Grue Simonsen | Alexis Saurin | Andrew Polonsky | J. Simonsen | A. Polonsky | Giulio Manzonetto | A. Saurin
[1] Herman Geuvers,et al. On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[2] Jörg Endrullis,et al. Reduction Under Substitution , 2008, RTA.
[3] Richard Statman,et al. Lambda theories allowing terms with a finite number of fixed points , 2017, Math. Struct. Comput. Sci..
[4] Paula Severi,et al. Nominal Coalgebraic Data Types with Applications to Lambda Calculus , 2013, Log. Methods Comput. Sci..
[5] Giulio Manzonetto,et al. From λ-calculus to Universal Algebra and Back , 2008 .
[6] Paula Severi,et al. Order Structures on Böhm-Like Models , 2005, CSL.
[7] Jan Willem Klop,et al. Modular Construction of Fixed Point Combinators and Clocked Böhm Trees , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.
[8] Richard Statman. On the lambdaY calculus , 2004, Ann. Pure Appl. Log..
[9] Antonio Bucciarelli,et al. Graph easy sets of mute lambda terms , 2016, Theor. Comput. Sci..
[10] Benedetto Intrigila,et al. On the number of fixed points of a combinator in lambda calculus , 2000, Mathematical Structures in Computer Science.
[11] Roberto M. Amadio,et al. Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.
[12] Benedetto Intrigila,et al. Non-existent Statman's Double Fixedpoint Combinator Does Not Exist, Indeed , 1997, Inf. Comput..
[13] Jan Willem Klop,et al. Discriminating Lambda-Terms Using Clocked Boehm Trees , 2014, Log. Methods Comput. Sci..
[14] Richard Statman,et al. Some Examples of Non-Existent Combinators , 1993, Theor. Comput. Sci..
[15] Antonino Salibra. Nonmodularity Results for Lambda Calculus , 2001, Fundam. Informaticae.
[16] C.-H. Luke Ong. Correspondence between Operational and Denotational Semantics , 1995, LICS 1995.
[17] Gordon D. Plotkin. The lambda-Calculus is omega-Incomplete , 1974, J. Symb. Log..
[18] M. Hyland. A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus , 1976 .
[19] Christopher P. Wadsworth,et al. The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..
[20] Andrew Polonsky. The range property fails for H , 2012, J. Symb. Log..
[21] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[22] Thierry Coquand,et al. A - Translation and Looping Combinators in Pure Type Systems , 1994, J. Funct. Program..
[23] Alberto Carraro,et al. Ordered Models of the Lambda Calculus , 2013, Log. Methods Comput. Sci..
[24] Antonino Salibra,et al. The Lattice of Lambda Theories , 2004, J. Log. Comput..