Hendrik Pieter Barendregt

Sebastiaan A. Terwijn

Theor. Comput. Sci., 2022

Axiomatizing Consciousness with Applications.

[BibT_eX]

[DOI]

Antonino Raffone

Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

A Lambda Calculus Satellite.

[BibT_eX]

[DOI]

Giulio Manzonetto

College Publications, ISBN: 978-1-84890-415-6, 2022

2020

Gems of Corrado Böhm.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

2019

Fixed point theorems for precomplete numberings.

[BibT_eX]

[DOI]

Sebastiaan A. Terwijn

Ann. Pure Appl. Log., 2019

2017

Statman's Hierarchy Theorem.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

2015

Automata Theoretic Account of Proof Search.

[BibT_eX]

[DOI]

Aleksy Schubert

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Computerising Mathematical Text.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic, 2014

Metacognitive awareness of covert somatosensory attention corresponds to contralateral alpha power.

[BibT_eX]

[DOI]

Stephen Whitmarsh

Jan-Mathijs Schoffelen

Ole Jensen

NeuroImage, 2014

2013

Reflection in the Chomsky Hierarchy.

[BibT_eX]

[DOI]

Venanzio Capretta

Dexter Kozen

J. Autom. Lang. Comb., 2013

An Ontology of States.

[BibT_eX]

[DOI]

Andrew Polonsky

Proceedings of the Beauty of Functional Code, 2013

Lambda Calculus with Types.

[BibT_eX]

[DOI]

Richard Statman

Perspectives in logic, Cambridge University Press, ISBN: 978-0-521-76614-2, 2013

2012

Loader and Urzyczyn Are Logically Related.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem.

[BibT_eX]

[DOI]

Cezary Kaliszyk

Proceedings of the Certified Programs and Proofs - First International Conference, 2011

2009

Applications of infinitary lambda calculus.

[BibT_eX]

[DOI]

Inf. Comput., 2009

2008

Proofs of Correctness in Mathematics and Industry.

[BibT_eX]

[DOI]

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Towards the range property for the lambda theory H.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

Proving the Range Property for Lambda Theories and Models.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006

Informal.

[BibT_eX]

[DOI]

Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

2005

Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms.

[BibT_eX]

[DOI]

Richard Statman

Proceedings of the Processes, 2005

2002

Autarkic Computations in Formal Proofs.

[BibT_eX]

[DOI]

Erik Barendsen

J. Autom. Reason., 2002

The Ancient Theory of Mind.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2002

2001

Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants.

[BibT_eX]

[DOI]

Arjeh M. Cohen

J. Symb. Comput., 2001

Computing and Proving.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Proof-Assistants Using Dependent Type Systems.

[BibT_eX]

[DOI]

Herman Geuvers

Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000

Lambda terms for natural deduction, sequent calculus and cut elimination.

[BibT_eX]

[DOI]

Silvia Ghilezan

J. Funct. Program., 2000

Representing and handling mathematical concepts by humans and machines.

[BibT_eX]

[DOI]

Arjeh M. Cohen

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999

Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms.

[BibT_eX]

[DOI]

Richard Statman

J. Funct. Program., 1999

1998

Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic.

[BibT_eX]

[DOI]

Martin W. Bunder

J. Symb. Log., 1998

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.

[BibT_eX]

[DOI]

Martin W. Bunder

Arch. Math. Log., 1998

1997

The impact of the lambda calculus in logic and computer science.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1997

1995

Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems.

[BibT_eX]

[DOI]

Yoshihito Toyama

J. ACM, 1995

Enumerators of lambda Terms are Reducing Constructively.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

A Two-Level Approach Towards Lean Proof-Checking.

[BibT_eX]

[DOI]

Gilles Barthe

Mark Ruys

Proceedings of the Types for Proofs and Programs, 1995

1993

Constructive Proofs of the Range Property in lambda-Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus.

[BibT_eX]

[DOI]

Martin W. Bunder

J. Symb. Log., 1993

Experience with a clustered parallel reduction machine.

[BibT_eX]

[DOI]

J. C. Mulder

Future Gener. Comput. Syst., 1993

1992

Representing 'undefined' in lambda Calculus.

[BibT_eX]

[DOI]

J. Funct. Program., 1992

Enumerators of lambda Terms are Reducing.

[BibT_eX]

[DOI]

J. Funct. Program., 1992

1991

Self-Interpretations in lambda Calculus.

[BibT_eX]

[DOI]

J. Funct. Program., 1991

Introduction to Generalized Type Systems.

[BibT_eX]

[DOI]

J. Funct. Program., 1991

1990

Types in Lambda Calculi and Programming Languages.

[BibT_eX]

[DOI]

Kees Hemerik

Proceedings of the ESOP'90, 1990

Functional Programming and Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

LEAN: an intermediate language based on graph rewriting.

[BibT_eX]

[DOI]

John R. W. Glauert

Parallel Comput., 1989

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-.

[BibT_eX]

[DOI]

Yoshihito Toyama

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1987

Needed Reduction and Spine Strategies for the Lambda Calculus

[BibT_eX]

[DOI]

Inf. Comput., December, 1987

The Dutch parallel reduction machine project.

[BibT_eX]

[DOI]

Pieter H. Hartel

Louis O. Hertzberger

Willem G. Vree

Future Gener. Comput. Syst., 1987

Towards an Intermediate Language based on Graph Rewriting.

[BibT_eX]

[DOI]

John R. W. Glauert

Proceedings of the PARLE, 1987

Term Graph Rewriting.

[BibT_eX]

[DOI]

John R. W. Glauert

Proceedings of the PARLE, 1987

1986

Functional Programming and the Language TALE.

[BibT_eX]

[DOI]

Marc van Leeuwen

Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

1985

The lambda calculus - its syntax and semantics.

[BibT_eX]

Studies in logic and the foundations of mathematics 103, North-Holland, ISBN: 978-0-444-86748-3, 1985

1983

A Filter Lambda Model and the Completeness of Type Assignment.

[BibT_eX]

[DOI]

Mariangiola Dezani-Ciancaglini

Mario Coppo

J. Symb. Log., 1983

Semantics for Classical AUTOMATH and Related Systems

[BibT_eX]

[DOI]

Adrian Rezus

Inf. Control., 1983

1978

Degrees of Sensible Lambda Theories.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

1976

A Global Representation of the Recursive Functions in the <i> lambda </i> -Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

1975

Normed uniformly reflexive structures.

[BibT_eX]

[DOI]

Proceedings of the Lambda-Calculus and Computer Science Theory, 1975

1973

A Characterization of Terms of the lambda I-Calculus Having a Normal Form.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

1971

Some extensional term models for combinatory logics and l - calculi.

[BibT_eX]