Fixed point combinators as fixed points of higher-order fixed point generators
暂无分享,去创建一个
[1] Douglas J. Howe. The Computational Behaviour of Girard's Paradox , 1987, LICS.
[2] Benedetto Intrigila,et al. Non-existent Statman's Double Fixedpoint Combinator Does Not Exist, Indeed , 1997, Inf. Comput..
[3] Dana S. Scott,et al. Some philosophical issues concerning theories of combinators , 1975, Lambda-Calculus and Computer Science Theory.
[4] Richard Statman,et al. Some Examples of Non-Existent Combinators , 1993, Theor. Comput. Sci..
[5] H. B. Curry. The inconsistency of certain formal logics , 1942, Journal of Symbolic Logic.
[6] Giulio Manzonetto,et al. The fixed point property and a technique to harness double fixed point combinators , 2019, J. Log. Comput..
[7] Andrew Polonsky,et al. Infinitary Rewriting Coinductively , 2011, TYPES.
[8] Richard Statman,et al. Lambda Calculus with Types , 2013, Perspectives in logic.
[9] Thierry Coquand,et al. A - Translation and Looping Combinators in Pure Type Systems , 1994, J. Funct. Program..
[10] Jan Willem Klop,et al. Infinitary Lambda Calculus , 1997, Theoretical Computer Science.
[11] Jan Willem Klop,et al. Discriminating Lambda-Terms Using Clocked Boehm Trees , 2014, Log. Methods Comput. Sci..
[12] Lukasz Czajka. A Coinductive Confluence Proof for Infinitary Lambda-Calculus , 2014, RTA-TLCA.
[13] Albert R. Meyer,et al. "Type" is not a type , 1986, POPL '86.