Hendrik Pieter Barendregt

According to our database1, Hendrik Pieter Barendregt authored at least 57 papers between 1971 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Fixed point theorems for precomplete numberings.
Ann. Pure Appl. Logic, 2019

2018
Gems of Corrado Böhm.
CoRR, 2018

Fixed point theorems for precomplete numberings.
CoRR, 2018

2017
Statman's Hierarchy Theorem.
Logical Methods in Computer Science, 2017

Statman's Hierarchy Theorem.
CoRR, 2017

2015
Automata Theoretic Account of Proof Search.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Computerising Mathematical Text.
Proceedings of the Computational Logic, 2014

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

2013
Reflection in the Chomsky Hierarchy.
Journal of Automata, Languages and Combinatorics, 2013

An Ontology of States.
Proceedings of the Beauty of Functional Code, 2013

Lambda Calculus with Types.
Perspectives in logic, Cambridge University Press, ISBN: 978-0-521-76614-2, 2013

2012
Loader and Urzyczyn Are Logically Related.
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.
Proceedings of the Certified Programs and Proofs - First International Conference, 2011

2009
Applications of infinitary lambda calculus.
Inf. Comput., 2009

2008
Proofs of Correctness in Mathematics and Industry.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Towards the range property for the lambda theory H.
Theor. Comput. Sci., 2008

2007
Proving the Range Property for Lambda Theories and Models.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006
Informal.
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.
Proceedings of the Processes, 2005

2002
Autarkic Computations in Formal Proofs.
J. Autom. Reasoning, 2002

The Ancient Theory of Mind.
Formal Asp. Comput., 2002

2001
Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants.
J. Symb. Comput., 2001

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

Proof-Assistants Using Dependent Type Systems.
Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000
Lambda terms for natural deduction, sequent calculus and cut elimination.
J. Funct. Program., 2000

Representing and handling mathematical concepts by humans and machines.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999
Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms.
J. Funct. Program., 1999

1998
Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic.
J. Symb. Log., 1998

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.
Arch. Math. Log., 1998

1997
The impact of the lambda calculus in logic and computer science.
Bulletin of Symbolic Logic, 1997

1995
Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems.
J. ACM, 1995

Enumerators of lambda Terms are Reducing Constructively.
Ann. Pure Appl. Logic, 1995

A Two-Level Approach Towards Lean Proof-Checking.
Proceedings of the Types for Proofs and Programs, 1995

1993
Constructive Proofs of the Range Property in lambda-Calculus.
Theor. Comput. Sci., 1993

Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus.
J. Symb. Log., 1993

Experience with a clustered parallel reduction machine.
Future Generation Comp. Syst., 1993

1992
Representing 'undefined' in lambda Calculus.
J. Funct. Program., 1992

Enumerators of lambda Terms are Reducing.
J. Funct. Program., 1992

1991
Self-Interpretations in lambda Calculus.
J. Funct. Program., 1991

Introduction to Generalized Type Systems.
J. Funct. Program., 1991

1990
Types in Lambda Calculi and Programming Languages.
Proceedings of the ESOP'90, 1990

Functional Programming and Lambda Calculus.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
LEAN: an intermediate language based on graph rewriting.
Parallel Computing, 1989

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-.
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1987
Needed Reduction and Spine Strategies for the Lambda Calculus
Inf. Comput., December, 1987

The Dutch parallel reduction machine project.
Future Generation Comp. Syst., 1987

Towards an Intermediate Language based on Graph Rewriting.
Proceedings of the PARLE, 1987


1986
Functional Programming and the Language TALE.
Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

1985
The lambda calculus - its syntax and semantics.
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.
J. Symb. Log., 1983

Semantics for Classical AUTOMATH and Related Systems
Information and Control, 1983

1978
Degrees of Sensible Lambda Theories.
J. Symb. Log., 1978

1976
A Global Representation of the Recursive Functions in the lambda -Calculus.
Theor. Comput. Sci., 1976

1975
Normed uniformly reflexive structures.
Proceedings of the Lambda-Calculus and Computer Science Theory, 1975

1973
A Characterization of Terms of the lambda I-Calculus Having a Normal Form.
J. Symb. Log., 1973

1971
Some extensional term models for combinatory logics and l - calculi.
PhD thesis, 1971


  Loading...