See this document in CiteSeerX!

Notes on Sconing and Relators (1993)  (Make Corrections)  (28 citations)
John C. Mitchell, Andre Scedrov
Computer Science Logic '92, Selected Papers



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
upenn.edu/pub/papers/scedrov...rel.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  upenn.edu (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper describes a semantics of typed lambda calculi based on relations. The main mathematical tool is a category-theoretic method of sconing, also called glueing or Freyd covers. Its correspondence to logical relations is also examined. 1 Introduction Many modern programming languages feature rather sophisticated typing mechanisms. In particular, languages such as ML include polymorphic data types, which allow considerable programming flexibility. Several notions of polymorphism were... (Update)

Cited by:   More
Complete Lax Logical Relations for Cryptographic.. - Goubault-Larrecq.. (2004)   (Correct)
A Generalisation of Pre-logical Predicates to Simply Typed.. - Katsumata   (Correct)
Formal Parametric Polymorphism - Martn Abadi Luca (1993)   (Correct)

Active bibliography (related documents):   More   All
1.0:   A Characterization Of Lambda Definability In Categorical Models .. - Alimohamed (1995)   (Correct)
0.5:   Some Intuitions Behind Realizability Semantics for.. - Lipton, O'Donnell (1996)   (Correct)
0.5:   Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996)   (Correct)

Similar documents based on text:   More   All
0.3:   Contract Signing, Optimism, and Advantage - Rohit Chadha John   (Correct)
0.1:   Categorical Glueing and Logical Predicates for Models of Linear.. - Hasegawa (1999)   (Correct)
0.1:   Abstract Models of Storage - Tennent, Ghica (2000)   (Correct)

Related documents from co-citation:   More   All
13:   Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
10:   Observable properties of higher order functions that dynamically create local na.. - Pitts, Stark - 1993
9:   abstraction and parametric polymorphism (context) - Reynolds - 1983

BibTeX entry:   (Update)

J. C. Mitchell and A. Scedrov. Notes on sconing and relators. In E. Boerger, editor, Computer Science Logic '92, Selected Papers, volume 702 of Lecture Notes in Computer Science, pages 352--378, 1993. http://citeseer.ist.psu.edu/mitchell93notes.html   More

@inproceedings{ mitchell93notes,
    author = "John C. Mitchell and Andre Scedrov",
    title = "Notes on Sconing and Relators",
    booktitle = "Computer Science Logic '92, Selected Papers",
    volume = "702",
    publisher = "Springer-Verlag",
    editor = "E. Boerger et al.",
    pages = "352--378",
    year = "1993",
    url = "citeseer.ist.psu.edu/mitchell93notes.html" }
Citations (may not include all citations):
562   Categories for the Working Mathematician (context) - Lane - 1971
359   Introduction to Higher-Order Categorical Logic (context) - Lambek, Scott - 1986
291   Computational lambda calculus and monads - Moggi - 1989
143   Theorems for free - Wadler - 1989
139   Type systems for programming languages (context) - Mitchell - 1990  ACM   DBLP
133   Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
97   and parametric polymorphism (context) - Reynolds, abstraction - 1983
63   Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990
56   A theory of programming language semantics (context) - Milne, Strachey - 1976
53   Lambda definability in the full type hierarchy (context) - Plotkin - 1980
52   the relation between direct and continuation semantics (context) - Reynolds - 1974
46   Relational parametricity and local variables (context) - O'Hearn, Tennent - 1993  ACM   DBLP
45   New foundations for fixpoint computations: FIXhyperdoctrines.. (context) - Crole, Pitts - 1992
42   Categorical semantics for higher order polymorphic lambda ca.. (context) - Seely - 1987  DBLP
41   Kripke-style models for typed lambda calculus - Mitchell, Moggi - 1991  DBLP
39   Polymorphism is set-theoretic (context) - Pitts - 1987
37   Formal parametric polymorphism - Abadi, Cardelli et al. - 1993
33   Domain theoretic models of polymorphism - Coquand, Gunter et al. - 1989  ACM   DBLP
30   Logical relations and the typed lambda calculus (context) - Statman - 1985
29   A category-theoretic account of program modules - Moggi - 1991  ACM   DBLP
28   The semantics of second-order lambda calculus (context) - Bruce, Meyer et al. - 1990  ACM   DBLP
28   Doctrines in categorical logic (context) - Kock, Reyes - 1977
22   Second-order logical relations (context) - Mitchell, Meyer - 1985
22   Extensional models for polymorphism (context) - Breazu-Tannen, Coquand - 1988
18   Outline of a proof theory of parametricity - Mairson - 1991  ACM   DBLP
18   A relational approach to strictness analysis for higherorder.. - Abramsky, Jensen - 1991
16   International Summer School in Computer Programming (context) - Strachey, in et al. - 1967
14   Theoretical Aspects of Computer Software (context) - Cardelli, Mitchell et al. - 1991  ACM
12   Parametricity of extensionally collapsed term models of poly.. (context) - Hasegawa - 1991  ACM   DBLP
8   Functorial parametricity (context) - Freyd, Robinson et al. - 1992  DBLP
7   Theoretical Computer Science (context) - Freyd - 1993  ACM
6   Dinaturality for free (context) - Freyd, Robinson et al. - 1992
4   ese de Doctorat, Universit (context) - Lafont, Categories et al. - 1988
3   Mathematical Library (context) - Freyd, Scedrov et al. - 1990
2   Typed lambda calculus and cartesian closed categories (context) - Mitchell, Scott - 1989
2   A note on the Friedman slash and Freyd covers (context) - Scedrov, Scott - 1982
1   Categorical data types in parametric polymorphims (context) - Hasegawa - 1990



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cis.upenn.edu.html):   More
User-Controlled Physics-Based Animation for Articulated.. - Kokkevis, Metaxas, Badler (1996)   (Correct)
Semistructured Data - Buneman (1997)   (Correct)
A Hybrid Approach to Formal Verification Applied to an ATM.. - Clarke, Lee (1996)   (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