(Enter summary)
Abstract: We introduce a family of type theories as internal languages for autonomous (or symmetric
monoidal closed) and -autonomous categories, in the same sense that the simply-typed -calculus
with surjective pairing is the internal language for cartesian closed categories. The rules for the
typing judgements are presented in the style of Gentzen's Sequent Calculus. A notable feature is
the systematic treatment of naturality conditions by expressing the categorical composition, or cut
in the type... (Update)
Similar documents (at the sentence level):
35.7%: Type Theories for Autonomous and *-Autonomous Categories: I.. - Koh, Ong (1998)
(Correct)
33.9%: Explicit Substitution Internal Languages for Autonomous and.. - Koh, Ong (1999)
(Correct)
Active bibliography (related documents): More All
0.4: Exhausting Strategies, Joker Games and Full Completeness for.. - Murawski, Ong (1999)
(Correct)
0.2: Fair Games and Full Completeness for Multiplicative Linear.. - Hyland, Ong (1993)
(Correct)
0.1: Categorical Logic - Pitts (2001)
(Correct)
Similar documents based on text: More All
0.3: Route Oscillations in I-BGP with Route Reflection - Basu, Ong, Rasala, Shepherd, .. (2002)
(Correct)
0.0: Kripke resource models of a dependently-typed, bunched.. - Ishtiaq, Pym (1999)
(Correct)
0.0: An ALF Proof of Mac Lane's Coherence Theorem - Beylin (1997)
(Correct)
BibTeX entry: (Update)
@article{ koh99internal,
author = "Thong wei Koh and C.-H. Luke Ong",
title = "Internal Languages for Autonomous and *-Autonomous Categories",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "29",
year = "1999",
url = "citeseer.ist.psu.edu/225943.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Blute, coherence - 1993
236
Categories for the Working Mathematician (context) - MacLane - 1971
134
calculus: an algorithmic interpretation of classical natural.. (context) - Parigot - 1992
46
Term assignment for intuitionistic linear logic (context) - Benton, Bierman et al. - 1992
40
A Curry-Howard foundation for functional computation with co..
- Ong, Stewart - 1997
37
Natural deduction and coherence for weakly distributive cate..
- Blute, Cockett et al. - 1996
32
Mathematical Structures in Computer Science (context) - Barr, categories et al. - 1991
24
Coherence in closed categories (context) - Kelly, MacLane - 1971
22
a logique lin'eaire Appliqu'ee `a l"etude de divers processu.. (context) - Danos - 1990
17
Deductive systems and categories (context) - Lambek - 1968
13
Natural associativity and commutativity (context) - MacLane - 1963
8
An internal language for autonomous categories (context) - Mackie, Rom'an et al. - 1993
8
Joker Games and Full Completeness for IMLL with Unit (context) - Murawski, Ong - 1999
7
Languages for monoidal categories (context) - Jay - 1989
7
Proof-terms for classical and intuitionistic logic (context) - Ritter, Pym et al. - 1996
5
Lecture Notes in Mathematics Vol (context) - Barr, Categories - 1979
4
Multiplicative Linear Type Theories (context) - Koh - 1998
3
eseaux. PhD thesis, Universit (context) - Regnier - 1992
3
Type theories for autonomous and -autonomous categories (context) - Koh, Ong - 1998
Documents on the same site (http://www.comlab.ox.ac.uk/oucl/users/luke.ong/publications.html): More
A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997)
(Correct)
Non-Determinism in a Functional Setting (Extended Abstract) - Ong (1993)
(Correct)
Correspondence between Operational and Denotational Semantics - Ong (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC