Moez Alimohamed  Home/Search
Context Related
| upenn.edu/pub/papers/scedrov...def.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Lambda definability is characterized in categorical models of simply typed lambda calculus with type variables. A category-theoretic framework known as glueing or sconing is used to extend the Jung-Tiuryn characterization of lambda definability [JuT93], first to ccc models, and then to categorical models of the calculus with type variables. Logical relations are now a well-established tool for studying the semantics of various typed lambda calculi. The main lines of research are focused... (Update)
Context of citations to this paper: More
.... space X, the path space [ X over X is the disjoint sum l[xoCX [ o X, where the [ o X is the space of all continuous functions from [0, 1] to X such that (0) Xo, with the compact open topology. For every continuous function f: X Y, let [ f : X [ Y be the function...
Cited by: More
Complete Lax Logical Relations for Cryptographic.. - Goubault-Larrecq.. (2004) (Correct)
Pre-logical Relations - Honsell, Sannella (1999) (Correct)
On the Geometry of Intuitionistic S4 Proofs - Goubault-Larrecq, Goubault (2002) (Correct)
Active bibliography (related documents): More All
1.0: Notes on Sconing and Relators - Mitchell, Scedrov (1993) (Correct)
0.2: Normalization and the Yoneda Embedding - Cubric, Dybier, Scott (Correct)
0.2: Glueing Algebraic Structures on a 2-Category - Hasegawa (2000) (Correct)
Similar documents based on text: More All
0.7: Schwichtenberg-Style Lambda Definability is Undecidable. - Jan Maolepszy Magorzata (Correct)
0.2: A Relational Characterisation of Syntactic Definability in.. - Streicher (2001) (Correct)
0.2: Invariant Definability (Extended Abstract) - Makowsky (1997) (Correct)
Related documents from co-citation: More All
6: Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
6: Foundations for Programming Languages (context) - Mitchell - 1996
5: Lambda-Definability in the Full Type Hierarchy (context) - Plotkin - 1980
BibTeX entry: (Update)
Alimohamed, M. (1995) A characterization of lambda definability in categorical models of implicit polymorphism. Theoret. Comp. Sci. 146, 5--23. http://citeseer.ist.psu.edu/alimohamed95characterization.html More
@article{ alimohamed95characterization,
author = "Moez Alimohamed",
title = "A characterization of lambda definability in categorical models of implicit polymorphism",
journal = "Theoretical Computer Science",
volume = "146",
number = "1--2",
pages = "5--23",
year = "1995",
url = "citeseer.ist.psu.edu/alimohamed95characterization.html" }
Citations (may not include all citations):359 Introduction to Higher-Order Categorical Logic (context) - Lambek, Scott - 1986
147 abstraction and parametric polymorphism (context) - Reynolds - 1983
97 North Holland (context) - Freyd, Scedrov et al. - 1990
53 Lambda-definability in the full type hierarchy (context) - Plotkin - 1980
46 Relational parametricity and local variables (context) - O'Hearn, Tennent - 1993
42 Categorical semantics for higher order polymorphic lambda ca.. (context) - Seely - 1987
41 Kripke-style models for typed lambda calculus - Mitchell, Moggi - 1991
39 Polymorphism is set-theoretic (context) - Pitts - 1987
35 Cambridge University Press (context) - Crole, Types - 1993
30 Logical relations and the typed lambda calculus (context) - Statman - 1985
29 A category-theoretic account of program modules - Moggi - 1991
29 Relational properties of recursively defined domains - Pitts - 1993
28 Notes on sconing and relators - Mitchell, Scedrov - 1993
22 Second-order logical relations (context) - Mitchell, Meyer - 1985
20 A new characterization of lambda definability - Jung, Tiuryn - 1993
16 International Summer School in Computer Programming (context) - Strachey, in et al. - 1967
10 Kripke logical relations and PCF - O'Hearn, Riecke - 1994
4 ese de Doctorat, Universit (context) - Lafont, Categories et al. - 1988
2 Typed lambda calculus and cartesian closed categories (context) - Mitchell, Scott - 1989
1 An intersection problem for finite automata (context) - Saks, Statman - 1988
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