(Enter summary)
Abstract: We describe a variant of Milner's ML type inference algorithm which can be used to perform incremental
type checking of programs with partially unspecied functions (or predicates in Prolog). This
supports modication (e.g. for correction) of procedures dened previously and provides for a convenient
treatment of top-level mutual recursion including Prolog-style incremental clausal denition.
The system allows us to: dene a function of, say, type ! , use it in suceeding functions and
then... (Update)
Context of citations to this paper: More
...a situation comparable to multiply dened functions. This problem is called incremental polymorphic type checking with update by Mycroft in [30] and It is exactly the case of the programming INRIA Implicit Polymorphic Type System for the Blue Calculus 23 language Prolog where...
Cited by: More
Implicit Polymorphic Type System for the Blue Calculus - Dal-Zilio (1997)
(Correct)
Active bibliography (related documents): More All
0.3: Explicit Graphs in a Functional Model for Spatial Databases - Erwig, Güting (1994)
(Correct)
0.2: Program Analysis Position Statement: The Abstract Interpretation.. - Cousot (1996)
(Correct)
0.2: Type-Based Decompilation - Mycroft (1998)
(Correct)
Similar documents based on text: More All
0.1: CoSAWoE - A Model for Context-Sensitive Access Control in Workflow .. - Botha
(Correct)
0.1: Extending the Type Checker of SML by Polymorphic Recursion: A.. - Emms, Leiß (1997)
(Correct)
0.1: Minimal Function Graphs Are Not Instrumented - Mycroft, Rosendahl (1992)
(Correct)
BibTeX entry: (Update)
Alan Mycroft. Incremental polymorphic type checking with update. In Proc. LFCS'92, 2nd International Symposium Tver'92, volume 620 of Lecture Notes in Computer Science. Springer-Verlag, 1992. http://citeseer.ist.psu.edu/mycroft92incremental.html More
@inproceedings{ mycroft92incremental,
author = "Alan Mycroft",
title = "Incremental Polymorphic Type Checking with Update",
booktitle = "Logical Foundations of Computer Science",
pages = "347-357",
year = "1992",
url = "citeseer.ist.psu.edu/mycroft92incremental.html" }
Citations (may not include all citations):
343
Principal type schemes for functional programs (context) - Damas, Milner - 1982
258
Miranda: a non-strict functional language with polymorphic t.. (context) - Turner - 1985 ACM DBLP
109
A polymorphic type system for Prolog (context) - Mycroft, O'Keefe - 1984 DBLP
87
Operational semantics and polymorphic type inference (context) - Tofte - 1988
14
The undecidability of the semi-unication problem (context) - Kfoury, Tiuryn et al. - 1990
14
Polymorphic type schemes and recursive denition (context) - Mycroft - 1984
13
Type inference problems: a survey (context) - Tiuryn - 1990 ACM DBLP
5
A theory of polymorphism in programming (context) - Milner - 1978
3
on Lisp and Functional Programming (context) - Henglein - 1988
1
Available as Computer Science Report CST (context) - Damas, Type - 1985
1
the computational power of univerally polymorphic recursion (context) - Kfoury, Tiuryn et al. - 1988
1
A proper extension of ML with an eective type discipline (context) - Kfoury, Tiuryn et al. - 1988
1
Springer-Verlag LNCS vol (context) - Nikhil - 1985
Documents on the same site (http://www.cl.cam.ac.uk/users/am/papers/): More
Optimising Compilation - Mycroft, Norman (1992)
(Correct)
Type-Based Decompilation - Mycroft (1999)
(Correct)
Logical and Operational Methods in the Analysis of .. - Nielson, Cousot..
(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