Binary Lambda Calculus and Combinatory Logic.” Sep 14, 2004. http://homepages. cwi.nl/ ∼ tromp/cl/LC.pdf [64] Tadaki, K. “Upper bound by Kolmogorov complexity for the probability (2003)

by John Tromp
Venue:in computable POVM measurement.” Proceedings of the 5th Conference on Real Numbers and Computers, RNC5
Citations:10 - 0 self

Active Bibliography

377 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
288 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
260 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
253 Respects for Similarity – Douglas L. Medin , Robert L. Goldstone, Dedre Gentner - 1993
244 Typing and Subtyping for Mobile Processes – Benjamin Pierce , Davide Sangiorgi - 1996
215 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
Kolmogorov Complexity in Combinatory Logic – John Tromp March, John Tromp
229 Why Interaction Is More Powerful Than Algorithms – Peter Wegner - 1997
209 A new approach to abstract syntax with variable binding – Murdoch J. Gabbay, Andrew M. Pitts - 2002