|
|
Kolmogorov Complexity in Combinatory Logic
– John Tromp March, John Tromp
|
|
17
|
The Impact of the Lambda Calculus in Logic and Computer Science
– Henk Barendregt, Jon Barwise, Johan Van Benthem, Andreas Blass, Olivier Danvy, Pierre Lescanne, Hans Mooij, Robert Maron, Rinus Plasmeijer, Y Pollack
- 1997
|
|
2
|
Explicit Substitutions and All That
– Mauricio Ayala-Rincón, Cesar Muñoz
- 2000
|
|
12
|
A formal calculus for informal equality with binding
– Murdoch J. Gabbay, Aad Mathijssen
- 2007
|
|
|
An algorithmic information-theoretic approach to the behaviour of financial markets
– Hector Zenil, Jean-paul Delahaye
- 2010
|
|
4
|
Using Reflection to Support Type-Safe Evolution in Persistent Systems
– G. N. C. Kirby, R. C. H. Connor, R. Morrison, D. Stemple
- 1996
|
|
79
|
Multi-Stage Programming: Its Theory and Applications
– Walid Taha
- 1999
|
|
6
|
Towards a Theory of Reflective Programming Languages
– Anurag Mendhekar, C Flanurag Mendhekar, Daniel P. Friedman, Daniel P. Friedman
- 1993
|
|
1
|
Computing The Busy Beaver Function
– In T. M. Cover, B. Gopinath, Gregory J. Chaitin
- 1987
|
|
2
|
What is an Efficient Implementation of the λ-calculus?
– Gudmund S. Frandsen, Carl Sturtivant
- 1991
|
|
2
|
What is an Efficient Implementation of the λ-calculus?
– Gudmund S. Frandsen, Carl Sturtivant
- 1991
|
|
|
Lambda-Calculus and Functional Programming
– Jonathan P. Seldin
|
|
|
Theoretical Foundations for Practical ‘Totally Functional Programming’
– Colin Kemp
- 2007
|
|
10
|
Programming With Types
– Stephanie Claudene Weirich
- 2002
|
|
1
|
Randomness relative to Cantor expansions
– Cristian S. Calude, Ludwig Staiger, Karl Svozil
- 2003
|
|
5
|
Another Example of Higher Order Randomness
– Verónica Becher, Gregory Chaitin
- 2002
|
|
8
|
Bio-Steps Beyond Turing
– Cristian S. Calude, Gheorghe Păun
- 2004
|
|
3
|
A Topological Characterization of Random Sequences
– C. S. Calude, S. Marcus, L. Staiger, Cristian S. Calude, Solomon Marcus, Ludwig Staiger
- 2003
|
|
8
|
Computational Universes
– Karl Svozil
- 2005
|