|
2
|
Constructive Natural Deduction And Its "omega-Set" Interpretation
– Giuseppe Longo, Eugenio Moggi
- 1990
|
|
|
FULLY ABSTRACT SEMANTICS FORO BSERVABLY SEQUENTIAL LANGUAGES
– unknown authors
- 2004
|
|
|
Theory and Implementation of a Functional Programming Language
– Ari Lamstein
- 2000
|
|
|
A New Approach to Generic Functional Programming
– unknown authors
|
|
|
Contents TLCA List of Open Problems
– unknown authors
- 2007
|
|
|
FOR THE
– Andrew Jude Gacek, Gopalan Nadathur, Andrew Jude Gacek, Gopalan Nadathur Advisor
- 2006
|
|
|
Introduction Review of Type-Logical Semantics ∗
– Riccardo Pucella, Stephen Chong
|
|
|
Experience with a Clustered Parallel Reduction Machine
– M. Beemster, P. H. Hartel, L. O. Hertzberger, R. F. H. Hofman, K. G. Langendoen, L. L. Li, R. Milikowski, W. G. Vree, H. P. Barendregt, J. C. Mulder
- 1993
|
|
|
A completeness result for λµ
– Phillipe Audebaud, Steffen Bakel
|
|
|
unknown title
– unknown authors
|
|
|
βη-complete models for System F
– Stefano Berardi, Chantal Berline
- 2000
|
|
|
A Little Goes a Long Way: A Simple Tool to Support Denotational Compiler-Correctness Proofs
– Mitchell Wand, Mitchell W, Gregory T. Sullivan
|
|
|
Les Ensembles Intentionnels Par Les Substitutions Explicites
– Gilles Richard, Frederic Saubion, Agnes Tellez-Arenas
|
|
|
A Syntactic Method for Finding Least Fixed Points of Higher-Order Functions Over Finite Domains
– Tyng-Ruey Chuang, B. Goldberg, Benjamin Goldberg
- 1997
|
|
|
β-Reductions and β-Developments of λ-Terms with the Least Number of Steps
– Zurab O. Khasidashvili
|
|
|
Implementing β-Reduction by Hypergraph Rewriting
– Sabine Kuske, Fachbereich Mathematik Und Informatik
- 1995
|
|
|
Evolution of lambda-expressions through Genetic Programming
– Dorothea Heiss-Czedik, Walter Fontana
|
|
|
A Proof of Strong Normalization for Generalized Labelled Beta-Reduction By Means of the Successor Relation Method
– Jan Terlouw
- 1998
|
|
|
Graph Rewriting and Copying
– Erik Barendsen, Sjaak Smetsers
- 1992
|
