Jonathan P. Seldin

发表

Introduction to Combinators and Lambda-Calculus

J. Roger Hindley, Jonathan P. Seldin, J. Hindley, 1986 .

Lambda-Calculus and Combinators, an Introduction: Preface

J. Roger Hindley, Jonathan P. Seldin, 2008 .

Normalization and excluded middle. I

Jonathan P. Seldin, J. Seldin, 1989, Stud Logica.

Extensional Set Equality in the Calculus of Constructions

Jonathan P. Seldin, 2001, J. Log. Comput..

Introduction to combinators and λ-calculus

J. Roger Hindley, Jonathan P. Seldin, J. Hindley, 1986, Acta Applicandae Mathematicae.

Review: John T. Kearns, Combinatory Logic with Discriminators

Jonathan P. Seldin, 1973 .

Lambda-Calculus and Combinators: An Introduction

J. Roger Hindley, Jonathan P. Seldin, J. Hindley, 2008 .

The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II

Jonathan P. Seldin, 2017, Theor. Comput. Sci..

On lists and other abstract data types in the calculus of constructions

Jonathan P. Seldin, 2000, Math. Struct. Comput. Sci..

A Sequent Calculus Formulation of Type Assignment with Equality Rules for the lambda beta-Calculus

Jonathan P. Seldin, 1978, J. Symb. Log..

The Logic of Church and Curry

Jonathan P. Seldin, J. Seldin, 2009, Logic from Russell to Church.

The Q-consistency of F22

Jonathan P. Seldin, 1977, Notre Dame J. Formal Log..

On the role of implication in formal logic

Jonathan P. Seldin, J. Seldin, 2000, Journal of Symbolic Logic.

Bridging Curry and Church's typing style

Fairouz Kamareddine, Joe B. Wells, Jonathan P. Seldin, 2016, J. Appl. Log..

CURRY’S ANTICIPATION OF THE TYPES USED IN PROGRAMMING LANGUAGES

Jonathan P. Seldin, J. Seldin, 2002 .

The search for a reduction in combinatory logic equivalent to λβ-reduction

Jonathan P. Seldin, J. Seldin, 2011, Theor. Comput. Sci..

A sequent calculus for type assignment

Jonathan P. Seldin, J. Seldin, 1977, Journal of Symbolic Logic.

Fine-Resolution Imaging of Solar Features Using Phase-Diverse Speckle Imaging

Jonathan P. Seldin, Richard Greenwood Paxman, 1993 .

Equality in F 21

Jonathan P. Seldin, 1973, J. Symb. Log..

Some Anomalies in Fitch's System QD

Martin W. Bunder, Jonathan P. Seldin, 1978, J. Symb. Log..

On the Proof Theory of Coquand's Calculus of Constructions

Jonathan P. Seldin, J. Seldin, 1997, Ann. Pure Appl. Log..

Note on definitional reductions

Jonathan P. Seldin, J. Seldin, 1968, Notre Dame J. Formal Log..

Variants of the basic calculus of constructions

Martin W. Bunder, Jonathan P. Seldin, M. Bunder, 2004, J. Appl. Log..

Curry’s Formalism as Structuralism

Jonathan P. Seldin, J. Seldin, 2011, Logica Universalis.

A second corrigendum to my paper: "Note on definitional reductions"

Jonathan P. Seldin, J. Seldin, 1980, Notre Dame J. Formal Log..

Preface

Jonathan P. Seldin, Mariangiola Dezani-Ciancaglini, Giuseppe Longo, 1999, Math. Struct. Comput. Sci..

Corrigendum to my paper: "Note on definitional reductions"

Jonathan P. Seldin, 1969, Notre Dame J. Formal Log..

Interpreting HOL in the calculus of constructions

Jonathan P. Seldin, 2004, J. Appl. Log..

On the proof theory of the intermediate logic MH

Jonathan P. Seldin, J. Seldin, 1986, Journal of Symbolic Logic.

Lambda-Calculus and Combinators, an Introduction: References

J. Roger Hindley, Jonathan P. Seldin, 2008 .

A Gentzen-style sequent calculus of constructions with expansion rules

Jonathan P. Seldin, J. Seldin, 2000, Theor. Comput. Sci..

Bunder Maarten Wicher Visser. Set theory based on combinatory logic. Dissertation Amsterdam 1969, 80 pp. + 3 pp. of corrections.

Jonathan P. Seldin, 1970 .

Lambda-Calculus and Combinators, an Introduction: Care of your pet combinator

J. Roger Hindley, Jonathan P. Seldin, 2008 .

Coquand's calculus of constructions: A mathematical foundation for a proof development system

Jonathan P. Seldin, J. Seldin, 1992, Formal Aspects of Computing.

Introduction to combinatory logic

Rasmus Lerdorf, J. Roger Hindley, Jonathan P. Seldin, 1972 .

Phase-Diversity Data Sets and Processing Strategies

Jonathan P. Seldin, Richard G. Paxman, Christian Keller, 1999 .

Arithmetic as a study of formal systems

Jonathan P. Seldin, 1975, Notre Dame J. Formal Log..

On Adding (xi) to Weak Equality in Combinatory Logic

Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin, 1989, J. Symb. Log..

Review: Corrado Bohm, Wolf Gross, E. R. Caianiello, Introduction to the CUCH; C. Bohm, T. B. Steel, The CUCH as a Formal and Description Language

Jonathan P. Seldin, 1975 .

To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism

J. Roger Hindley, Jonathan P. Seldin, Haskell B. Curry, 1980 .

Equality in 22

Jonathan P. Seldin, 1975 .

Lambda-Calculus and Combinators, an Introduction: Representing the computable functions

J. Roger Hindley, Jonathan P. Seldin, 2008 .

Review: Maarten Wicher Visser Bunder, Set Theory based on Combinatory Logic

Jonathan P. Seldin, 1970 .

On adding (ξ) to weak equality in combinatory logic

Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin, 1989, Journal of Symbolic Logic.

Set Theory based on Combinatory Logic.

Jonathan P. Seldin, Maarten Wicher Visser Bunder, 1970 .

Review: N. G. De Bruijn, Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem

Jonathan P. Seldin, 1975 .