Henk Barendregt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 43 from 43

2022

Partial combinatory algebra and generalized numberingsHenk Barendregt, Sebastiaan A. Terwijn. TCS, 925:37-44, 2022. [doi]

Axiomatizing Consciousness with ApplicationsHenk Barendregt, Antonino Raffone. BIRTHDAY 2022: 46-62 [doi]

A Lambda Calculus SatelliteHenk Barendregt, Giulio Manzonetto. College Publications, 2022. [doi]

2019

Fixed point theorems for precomplete numberingsHenk Barendregt, Sebastiaan A. Terwijn. APAL, 170(10):1151-1161, 2019. [doi]

2017

Statman's Hierarchy TheoremBram Westerbaan, Bas Westerbaan, Rutger Kuyper, Carst Tankink, Remy Viehoff, Henk Barendregt. lmcs, 13(4), 2017. [doi]

2014

Computerising Mathematical TextFairouz Kamareddine, Joe B. Wells, Christoph Zengler, Henk Barendregt. In Jörg H. Siekmann, editor, Computational Logic. Volume 9 of Handbook of the History of Logic, pages 343-396, Elsevier, 2014. [doi]

Metacognitive awareness of covert somatosensory attention corresponds to contralateral alpha powerStephen Whitmarsh, Henk Barendregt, Jan-Mathijs Schoffelen, Ole Jensen. neuroimage, 85:803-809, 2014. [doi]

2013

Reflection in the Chomsky HierarchyHenk Barendregt, Venanzio Capretta, Dexter Kozen. jalc, 18(1):53-60, 2013.

An Ontology of StatesAndrew Polonsky, Henk Barendregt. BIRTHDAY 2013: 18-26 [doi]

2012

Loader and Urzyczyn Are Logically RelatedSylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt. icalp 2012: 364-376 [doi]

2011

Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point TheoremCezary Kaliszyk, Henk Barendregt. CPP 2011: 87-102 [doi]

2009

Applications of infinitary lambda calculusHenk Barendregt, Jan Willem Klop. iandc, 207(5):559-582, 2009. [doi]

2008

Towards the range property for the lambda theory HHenk Barendregt. TCS, 398(1-3):12-15, 2008. [doi]

2007

Proving the Range Property for Lambda Theories and ModelsHenk Barendregt. ictcs 2007: 4

2006

InformalHenk Barendregt. tphol 2006: 10 [doi]

2005

Böhm s Theorem, Church s Delta, Numeral Systems, and Ershov MorphismsRichard Statman, Henk Barendregt. BIRTHDAY 2005: 40-54 [doi]

2002

The Ancient Theory of MindHenk Barendregt. fac, 13(3-5):422-429, 2002. [doi]

Autarkic Computations in Formal ProofsHenk Barendregt, Erik Barendsen. JAR, 28(3):321-336, 2002.

2001

Proof-Assistants Using Dependent Type SystemsHenk Barendregt, Herman Geuvers. In John Alan Robinson, Andrei Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes). pages 1149-1238, Elsevier and MIT Press, 2001.

Computing and ProvingHenk Barendregt. RTA 2001: 1 [doi]

Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof AssistantsHenk Barendregt, Arjeh M. Cohen. JSC, 32(1/2):3-22, 2001.

2000

Lambda terms for natural deduction, sequent calculus and cut eliminationHenk Barendregt, Silvia Ghilezan. JFP, 10(1):121-134, 2000.

Representing and handling mathematical concepts by humans and machinesHenk Barendregt, Arjeh M. Cohen. issac 2000: [doi]

1999

Applications of Plotkin-Terms: Partitions and Morphisms for Closed TermsRichard Statman, Henk Barendregt. JFP, 9(5):565-575, 1999.

1998

Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory LogicWil Dekkers, Martin W. Bunder, Henk Barendregt. JSYML, 63(3):869-890, 1998.

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculusWil Dekkers, Martin W. Bunder, Henk Barendregt. AML, 37(5-6):327-341, 1998. [doi]

1997

The impact of the lambda calculus in logic and computer scienceHenk Barendregt. bsl, 3(2):181-215, 1997. [doi]

1995

Enumerators of lambda Terms are Reducing ConstructivelyHenk Barendregt. APAL, 73(1):3-9, 1995.

A Two-Level Approach Towards Lean Proof-CheckingGilles Barthe, Mark Ruys, Henk Barendregt. TYPES 1996: 16-35 [doi]

1993

Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate CalculusHenk Barendregt, Martin W. Bunder, Wil Dekkers. JSYML, 58(3):769-788, 1993.

Constructive Proofs of the Range Property in lambda-CalculusHenk Barendregt. TCS, 121(1&2):59-69, 1993.

1992

Enumerators of lambda Terms are ReducingHenk Barendregt. JFP, 2(2):233-236, 1992.

Representing undefined in lambda CalculusHenk Barendregt. JFP, 2(3):367-374, 1992.

1991

Introduction to Generalized Type SystemsHenk Barendregt. JFP, 1(2):125-154, 1991.

Self-Interpretations in lambda CalculusHenk Barendregt. JFP, 1(2):229-233, 1991.

1990

Types in Lambda Calculi and Programming LanguagesHenk Barendregt, Kees Hemerik. ESOP 1990: 1-35

1986

Functional Programming and the Language TALEHenk Barendregt, Marc van Leeuwen. In J. W. de Bakker, Willem P. de Roever, Grzegorz Rozenberg, editors, Current Trends in Concurrency, Overviews and Tutorials. Volume 224 of Lecture Notes in Computer Science, pages 122-207, Springer, 1986.

1983

Semantics for Classical AUTOMATH and Related SystemsHenk Barendregt, Adrian Rezus. iandc, 59(1-3):127-147, October/November/December 1983.

A Filter Lambda Model and the Completeness of Type AssignmentHenk Barendregt, Mario Coppo, Mariangiola Dezani-Ciancaglini. JSYML, 48(4):931-940, 1983.

1978

Degrees of Sensible Lambda TheoriesHenk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken. JSYML, 43(1):45-55, 1978.

1976

A Global Representation of the Recursive Functions in the :::: lambda :::: -CalculusHenk Barendregt. TCS, 3(2):225-242, 1976.

1975

Normed uniformly reflexive structuresHenk Barendregt. lambda 1975: 272-286

1973

A Characterization of Terms of the lambda I-Calculus Having a Normal FormHenk Barendregt. JSYML, 38(3):441-445, 1973.

Sign in or sign up to see more results.

runs on WebDSL