Joachim Lambek

Affiliations:

McGill University, Montréal, QC, Canada

According to our database¹, Joachim Lambek authored at least 24 papers between 1968 and 2012.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2012

Logic and Grammar.

[BibT_eX]

[DOI]

Joachim Lambek

Stud Logica, 2012

2010

Exploring Feature Agreement in French with Parallel Pregroup Computations.

[BibT_eX]

[DOI]

Joachim Lambek

J. Log. Lang. Inf., 2010

2008

Pregroup Grammars and Chomsky's Earliest Examples.

[BibT_eX]

[DOI]

Joachim Lambek

J. Log. Lang. Inf., 2008

2007

Should Pregroup Grammars be Adorned with Additional Operations?

[BibT_eX]

[DOI]

Joachim Lambek

Stud Logica, 2007

Free compact 2-categories.

[BibT_eX]

[DOI]

Anne Preller

Joachim Lambek

Math. Struct. Comput. Sci., 2007

From word to sentence: a pregroup analysis of the object pronoun <i>who</i> ( <i>m</i> ).

[BibT_eX]

[DOI]

Joachim Lambek

J. Log. Lang. Inf., 2007

2005

An Exactification of the Monoid of Primitive Recursive Functions.

[BibT_eX]

[DOI]

Joachim Lambek

Philip J. Scott

Stud Logica, 2005

2004

What is the world of mathematics?

[BibT_eX]

[DOI]

Joachim Lambek

Ann. Pure Appl. Log., 2004

2002

A Tale of Four Grammars.

[BibT_eX]

[DOI]

Claudia Casadio

Joachim Lambek

Stud Logica, 2002

2001

Type Grammars as Pregroups.

[BibT_eX]

[DOI]

Joachim Lambek

Grammars, 2001

An Algebraic Analysis of Clitic Pronouns in Italian.

[BibT_eX]

[DOI]

Claudia Casadio

Joachim Lambek

Proceedings of the Logical Aspects of Computational Linguistics, 2001

An Algebraic Approach to French Sentence Structure.

[BibT_eX]

[DOI]

Daniele Bargelli

Joachim Lambek

Proceedings of the Logical Aspects of Computational Linguistics, 2001

2000

Pregroups: A New Algebraic Approach to Sentence Structure.

[BibT_eX]

Jim Lambek

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1998

Relations old and new (invited paper).

[BibT_eX]

Joachim Lambek

Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997

Programs, grammars and arguments: a personal view of some connections between computation, language and logic.

[BibT_eX]

[DOI]

Jim Lambek

Bull. Symb. Log., 1997

Type Grammar Revisited.

[BibT_eX]

[DOI]

Joachim Lambek

Proceedings of the Logical Aspects of Computational Linguistics, 1997

1995

Cut Elimination for Classical Bilinear Logic.

[BibT_eX]

[DOI]

Joachim Lambek

Fundam. Informaticae, 1995

1993

Least Fixpoints of Endofunctors of Cartesian Closed Categories.

[BibT_eX]

[DOI]

Joachim Lambek

Math. Struct. Comput. Sci., 1993

1989

On some connections between logic and category theory.

[BibT_eX]

[DOI]

Joachim Lambek

Stud Logica, 1989

Fixpoints Revisited.

[BibT_eX]

[DOI]

Joachim Lambek

Proceedings of the Logic at Botik '89, 1989

1985

Cartesian Closed Categories and Typed Lambda- calculi.

[BibT_eX]

[DOI]

Joachim Lambek

Proceedings of the Combinators and Functional Programming Languages, 1985

1983

New Proofs of Some Intuitionistic Principles.

[BibT_eX]

[DOI]

Joachim Lambek

Philip J. Scott

Math. Log. Q., 1983

1981

Intuitionist type theory and foundations.

[BibT_eX]

[DOI]

Joachim Lambek

Philip J. Scott

J. Philos. Log., 1981

1968

Deductive Systems and Categories I. Syntactic Calculus and Residuated Categories.

[BibT_eX]

[DOI]

Joachim Lambek

Math. Syst. Theory, 1968

Joachim Lambek

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...