Jonathan P. Seldin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2018

Formalism and Structuralism, a Synthesis: the Philosophical Ideas of H. B. CurryJonathan P. Seldin. flap, 5(6):1301-1306, 2018. [doi]

2017

The search for a reduction in combinatory logic equivalent to λβ-reduction, Part IIJonathan P. Seldin. TCS, 663:34-58, 2017. [doi]

2016

Bridging Curry and Church's typing styleFairouz Kamareddine, Jonathan P. Seldin, J. B. Wells. japll, 18:42-70, 2016. [doi]

2011

The search for a reduction in combinatory logic equivalent to λβ-reductionJonathan P. Seldin. TCS, 412(37):4905-4918, 2011. [doi]

Curry's Formalism as StructuralismJonathan P. Seldin. lu, 5(1):91-100, 2011. [doi]

2009

The Logic of Church and CurryJonathan P. Seldin. In Dov M. Gabbay, John Woods, editors, Logic from Russell to Church. Volume 5 of Handbook of the History of Logic, pages 819-873, Elsevier, 2009. [doi]

2004

Variants of the basic calculus of constructionsMartin W. Bunder, Jonathan P. Seldin. japll, 2(2):191-217, 2004. [doi]

Interpreting HOL in the calculus of constructionsJonathan P. Seldin. japll, 2(2):173-189, 2004. [doi]

2001

Extensional Set Equality in the Calculus of ConstructionsJonathan P. Seldin. logcom, 11(3):483-493, 2001. [doi]

2000

On The Role of Implication in Formal LogicJonathan P. Seldin. JSYML, 65(3):1076-1114, 2000.

A Gentzen-style sequent calculus of constructions with expansion rulesJonathan P. Seldin. TCS, 243(1-2):199-215, 2000. [doi]

On lists and other abstract data types in the calculus of constructionsJonathan P. Seldin. mscs, 10(2):261-276, 2000.

1999

PrefaceMariangiola Dezani-Ciancaglini, Giuseppe Longo, Jonathan P. Seldin. mscs, 9(4):321, 1999.

1997

On the Proof Theory of Coquand s Calculus of ConstructionsJonathan P. Seldin. APAL, 83(1):23-101, 1997.

1992

Coquand s Calculus of Constructions: A Mathematical Foundation for a Proof Development SystemJonathan P. Seldin. fac, 4(5):425-441, 1992.

1989

On Adding (xi) to Weak Equality in Combinatory LogicMartin W. Bunder, J. Roger Hindley, Jonathan P. Seldin. JSYML, 54(2):590-607, 1989.

Normalization and excluded middle. IJonathan P. Seldin. sLogica, 48(2):193-217, 1989. [doi]

1986

Introduction to Combinators and Lambda-CalculusJ. Roger Hindley, Jonathan P. Seldin. Cambridge University Press, 1986.

On the Proof Theory of the Intermediate Logic MHJonathan P. Seldin. JSYML, 51(3):626-647, 1986.

1980

A second corrigendum to my paper: "Note on definitional reductions"Jonathan P. Seldin. ndjfl, 21(4):728, 1980. [doi]

1978

Some Anomalies in Fitch s System QDMartin W. Bunder, Jonathan P. Seldin. JSYML, 43(2):247-249, 1978.

A Sequent Calculus Formulation of Type Assignment with Equality Rules for the lambda beta-CalculusJonathan P. Seldin. JSYML, 43(4):643-649, 1978.

1977

A Sequent Calculus for Type AssignmentJonathan P. Seldin. JSYML, 42(1):11-28, 1977.

22Jonathan P. Seldin. ndjfl, 18(1):117-127, 1977. [doi]

1975

Arithmetic as a study of formal systemsJonathan P. Seldin. ndjfl, 16(4):449-464, 1975. [doi]

1973

Equality in F ::21::Jonathan P. Seldin. JSYML, 38(4):571-575, 1973.

1972

Introduction to combinatory logicJ. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin. Cambridge University Press, 1972.

1969

Corrigendum to my paper: "Note on definitional reductions"Jonathan P. Seldin. ndjfl, 10(4):412, 1969. [doi]

1968

Note on definitional reductionsJonathan P. Seldin. ndjfl, 9(1):4-6, 1968. [doi]

Sign in or sign up to see more results.

runs on WebDSL