Clocked lambda calculus †
暂无分享,去创建一个
Jan Willem Klop | Andrew Polonsky | Jörg Endrullis | Dimitri Hendriks | J. Endrullis | J. Klop | A. Polonsky | D. Hendriks
[1] Stephen G. Matthews. Metric domains for completeness , 1985 .
[2] Jan Willem Klop,et al. Highlights in infinitary rewriting and lambda calculus , 2012, Theor. Comput. Sci..
[3] Artur S. d'Avila Garcez,et al. We Will Show Them! Essays in Honour of Dov Gabbay, Volume One , 2005, We Will Show Them!.
[4] Jan Willem Klop,et al. Descendants and Origins in Term Rewriting , 2000, Inf. Comput..
[5] Hendrik Pieter Barendregt,et al. Applications of infinitary lambda calculus , 2009, Inf. Comput..
[6] Jan Willem Klop,et al. Infinitary Normalization , 2005, We Will Show Them!.
[7] Vincent van Oostrom,et al. On equal μ-terms , 2011, Theor. Comput. Sci..
[8] Antony A. Faustini. The equivalence of an operational and a denotational semantics for pure dataflow , 1982 .
[9] Benedetto Intrigila,et al. Non-existent Statman's Double Fixedpoint Combinator Does Not Exist, Indeed , 1997, Inf. Comput..
[10] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[11] P. Wegner. Lambda calculus , 2003 .
[12] Klaus Aehlig,et al. On Continuous Normalization , 2002, CSL.
[13] William W. Wadge. An Extensional Treatment of Dataflow Deadlock , 1981, Theor. Comput. Sci..
[14] Bas Luttik,et al. Computation Tree Logic with Deadlock Detection , 2009, Log. Methods Comput. Sci..
[15] Thierry Coquand,et al. A - Translation and Looping Combinators in Pure Type Systems , 1994, J. Funct. Program..
[16] Alessandro Berarducci,et al. Innite -calculus and non-sensible models , 1994 .
[17] N. Rescher,et al. Hypothetical Reasoning: Studies in Logic and the Foundations of Mathematics. , 1968 .
[18] Jakob Grue Simonsen,et al. Infinitary Combinatory Reduction Systems: Confluence , 2009, Log. Methods Comput. Sci..
[19] Vincent van Oostrom,et al. Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting , 2010, RTA.
[20] C. Coquand,et al. On the definition of reduction for infinite terms , 1996 .
[21] Larry Wos,et al. The Absence and the Presence of Fixed Point Combinators , 1991, Theor. Comput. Sci..
[22] Jan Willem Klop,et al. Infinitary Lambda Calculus , 1997, Theoretical Computer Science.
[23] 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.
[24] Maribel Fernández. The Lambda Calculus , 2009 .
[25] 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.
[26] Jan Willem Klop,et al. Clocks for Functional Programs , 2013, The Beauty of Functional Code.
[27] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[28] Luca Aceto,et al. Advanced Topics in Bisimulation and Coinduction , 2012, Cambridge tracts in theoretical computer science.
[29] C.-H. Luke Ong,et al. Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..
[30] Hans Zantema. Normalization of Infinite Terms , 2008, RTA.
[31] Thierry Coquand,et al. Infinite Objects in Type Theory , 1994, TYPES.
[32] Andrew Polonsky,et al. Infinitary Rewriting Coinductively , 2011, TYPES.
[33] Jan Willem Klop,et al. Discriminating Lambda-Terms Using Clocked Boehm Trees , 2014, Log. Methods Comput. Sci..
[34] R. Smullyan. To mock a mockingbird and other logic puzzles : including an amazing adventure in combinatory logic , 1985 .
[35] Yasuyoshi Inagaki,et al. Algebraic Semantics and Complexity of Term Rewriting Systems , 1989, RTA.