(Enter summary)
Abstract: We present the first algorithm for reconstructing the types
and effects of expressions in the presence of first class procedures
in a polymorphic typed language. Effects are static
descriptions of the dynamic behavior of expressions. Just
as a type describes what an expression computes, an effect
describes how an expression computes. Types are more
complicated to reconstruct in the presence of effects because
the algebra of effects induces complex constraints on both
effects and types. In this... (Update)
Context of citations to this paper: More
...There have not been many attempts to design languages neither for module re embedding nor for side effect descriptions. FX [JG90] and JADE [LR91] contain basic principles for side effect description but fSDL goes further because it allows the convenient combination...
...yes of course. There is a long history of research into so called effect systems, that track what kind of effects an expression can have [21]. Such effect systems can be expressed in a monadic way, or married with a monadic type system [51] However, the overhead on the...
Cited by: More
Report on the FX Programming Language - David Gifford Pierre
(Correct)
Static Dependent Costs for Estimating Execution Time - Brian Reistad David
(Correct)
Once Upon a Type - Turner, Wadler, Mossin (1997)
(Correct)
Active bibliography (related documents): More All
0.6: Type Reconstruction with First-Class Polymorphic Values - OToole, Jr., Gifford (1989)
(Correct)
0.5: The Type and Effect Discipline - Talpin, Jouvelot (1993)
(Correct)
0.3: On the Inference of Structured Recursive Effects with Subtyping - Debbabi, al. (1997)
(Correct)
Similar documents based on text: More All
0.4: The Marriage of Effects and Monads - Wadler (1998)
(Correct)
0.2: Reasoning about Continuations with Control Effects - Jouvelot, Gifford (1989)
(Correct)
0.1: Building the Case for Video Games in Music Education - Denis, Jouvelot (2004)
(Correct)
Related documents from co-citation: More All
38: Polymorphic effect systems (context) - Lucassen, Gifford - 1988
24: A theory of type polymorphism in programming (context) - Milner - 1978
20: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
BibTeX entry: (Update)
Pierre Jouvelot and David K. Gifford. Algebraic reconstruction of types and effects. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages, 1991. http://citeseer.ist.psu.edu/jouvelot91algebraic.html More
@inproceedings{ jouvelot91algebraic,
author = "Pierre Jouvelot and David Gifford",
title = "Algebraic Reconstruction of Types and Effects",
booktitle = "Conference Record of the Eighteenth Annual {ACM} Symposium on Principles of Programming Languages, Orlando, Florida",
publisher = "ACM Press",
pages = "303--310",
year = "1991",
url = "citeseer.ist.psu.edu/jouvelot91algebraic.html" }
Citations (may not include all citations):
809
A Theory of Type Polymorphism in Programming (context) - Milner - 1978
634
A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
369
A Semantics of Multiple Inheritance
- Cardelli - 1984
343
Principal Type Schemes for Functional Programs (context) - Damas, Milner - 1982
191
Linear-time Algorithms for Testing the Satisfiability of Pro.. (context) - Dowling, Gallier - 1984
139
Type Systems for Programming Languages (context) - Mitchell - 1989
118
Lambda-Calculus Models of Programming Languages (context) - Morris - 1968
107
Complete Type Inference for Simple Objects (context) - Wand - 1987
102
Type Inference for Record Concatenation and Multiple Inherit..
- Wand - 1989
99
Polymorphic Effect Systems (context) - Lucassen, Gifford - 1988
87
Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1987
56
ML With Extended Pattern Matching and Subtypes
- Jategaonkar - 1989
54
Partial Polymorphic Type Inference and Higher-Order Unificat.. (context) - Pfenning - 1988
38
Deciding ML Typability is Complete for Deterministic Exponen.. (context) - Mairson - 1990
33
NP-Completeness of the Set Unification and Matching Problems (context) - Kapur, Narendran - 1986
24
Characterization of Typings in Polymorphic Type Discipline (context) - Giannini, Ronchi - 1988
22
Corrigendum: Complete Type Inference for Simple Objects (context) - Wand - 1988
20
Adventures in Associative-Commutative Unification
- Lincoln, Christian - 1989
17
Partial Polymorphic Type Inference is Undecidable (context) - Boehm - 1985
16
Reasoning about Continuations with Control Effects
- Jouvelot, Gifford - 1989
10
FX-87 Performance Measurements: Dataflow Implementation
- Hammel, Gifford - 1988
7
Massachusetts Institute of Technology (context) - Gifford, Jouvelot et al. - 1987
6
Private communication (context) - McAllester, Blair - 1990
3
Communication Effects for Message-Based Concurrency (context) - Jouvelot, Gifford - 1989
2
Simple and Second-Order Type Structures (context) - Fortune, Leivant et al. - 1983
2
Polymorphic Type Reconstruction (context) - O'Toole, Gifford - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.purdue.edu/homes/palsberg/tba/): More
A Type-Based Locality Analysis for a Functional Distributed.. - Moreira (2000)
(Correct)
Fast and Effective Optimization of Statically Typed.. - Bacon (1997)
(Correct)
Region Analysis and the Polymorphic Lambda Calculus - Banerjee, Heintze, Riecke (1999)
(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