Xavier Leroy  Home/Search
Context Related
| pauillac.inria.fr/~x...phdthesis.ps.gz inria.fr/INRIA/publicat...RR1778.ps.gz 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: pauillac.inria.fr/publioscope (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The polymorphic type discipline, as in the ML language, fits well within purely applicative languages, but does not extend naturally to the main feature of algorithmic languages: in-place update of data structures. Similar typing difficulties arise with other extensions of applicative languages: logical variables, communication channels, continuation handling. This work studies (in the setting of relational semantics) two new approaches to the polymorphic typing of these non-applicative... (Update)
Context of citations to this paper: More
.... Sequential State The integration of imperative features and polymorphism in programming is an old and challenging technical problem [13, 22, 37]. Here we present a basic exten sion of afiqne polymorphic processes to stateful computation which is enough for our present purpose....
.... State The integration of imperative features and polymorphism in programming is an old and challenging technical problem [13, 22, 37]. Here we present a basic extension of ane polymorphic processes to stateful computation which is enough for our present purpose....
Cited by: More
Using, Understanding, and Unraveling - The OCaml Language - From.. - Remy (Correct)
Java Bytecode as a Typed Term Calculus - Higuchi, Ohori (2002) (Correct)
Relaxing the Value Restriction - Jacques Garrigue Research (2003) (Correct)
Active bibliography (related documents): More All
0.2: The Lazy Lambda Calculus - Abramsky (1990) (Correct)
0.2: Polymorphic Typing of Heterogeneous Lists - Monsuez (Correct)
0.2: Types in Programming Languages - Camarão, Figueiredo, Pimentel (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Polymorphic Type Inference and Assignment - Leroy, Weis (1991) (Correct)
0.5: Proc. 20th Symp. Principles of Programming Languages.. - Polymorphism By Name (Correct)
0.3: Dynamics in ML - Leroy, Mauny (1993) (Correct)
Related documents from co-citation: More All
12: Type inference for polymorphic references (context) - Tofte - 1990
11: Principal type schemes for functional programs (context) - Damas, Milner - 1982
10: A theory of type polymorphism in programming (context) - Milner - 1978
BibTeX entry: (Update)
X. Leroy. Polymorphic typing of an algorithmic language. Research report 1778, INRIA, 1992. http://citeseer.ist.psu.edu/leroy92polymorphic.html More
@techreport{ leroy92polymorphic,
author = "Xavier Leroy",
title = "Polymorphic Typing of An Algorithmic Language",
pages = "187",
year = "1992",
url = "citeseer.ist.psu.edu/leroy92polymorphic.html" }
Citations (may not include all citations):138 Type inference for polymorphic references (context) - Tofte - 1990
107 Complete type inference for simple objects (context) - Wand - 1987
99 Handbook of Theoretical Computer Science (context) - van Leeuwen - 1990
87 Operational semantics and polymorphic type inference (context) - Tofte - 1987
57 Continuation-based multiprocessing - Wand - 1980
56 Reference manual for the ADA programming language (context) - of - 1983
20 Typing references by effect inference - Wright - 1992
18 The type and effect discipline (context) - Talpin, Jouvelot - 1992
16 The CAML reference manual (context) - Weis - 1990
4 a non-strict functional language with polymorphic types (context) - Turner - 1985
1 A calculus of higher-order communicationg systems (context) - Thomsen - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pauillac.inria.fr/publioscope.html): More
Optimal Derivations in Weak Lambda-calculi and in Orthogonal.. - Maranget (1991) (Correct)
Functional Back-Ends within the Lambda-Sigma Calculus - Hardin, Maranget, Pagano (1996) (Correct)
Compiling Join-Patterns - Maranget, Le Fessant (1998) (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