(Enter summary)
Abstract: In this paper we present an algorithm for doing type inference in the context of Quasi-Static
Typing (QST) [12]. The package infers types a la "QST" for the simply typed -calculus. Typing
systems like QST can potentially give programers using statically typed languages some of the
advantages given by languages with dynamic typing, while keeping most of the advantages of
statically typed languages.
1
1 Introduction
The typing system of a programming language determines some of the features... (Update)
Similar documents (at the sentence level):
41.3%: An Algorithm for Inferring Quasi-Static Types - Oliart (1994)
(Correct)
Active bibliography (related documents): More All
0.3: Growth Grammar Interpreter GROGRA 2.4 - A software tool for the.. - Kurth (1994)
(Correct)
0.3: Recursive types and pattern-matching in Java - Forax, Roussel (1999)
(Correct)
0.0: Basic Polymorphic Typechecking - Cardelli (1988)
(Correct)
Similar documents based on text: More All
0.3: Dynamics in ML - Leroy, Mauny (1993)
(Correct)
0.2: On a New Statement of Inverse Problem of Quantum Scattering Theory - Airapetyan (2000)
(Correct)
0.1: String Cosmology: Concepts and Consequences - Veneziano (1995)
(Correct)
BibTeX entry: (Update)
@misc{ oliart-type,
author = "Alberto Oliart",
title = "Type Inference for Quasi-Static Types",
url = "citeseer.ist.psu.edu/oliart98type.html" }
Citations (may not include all citations):
13
Milner Principal Type Schemes for Functional Programs 9th AC.. (context) - Damas - 1982
3
i and Peter Wegner On Understanding Types, Data Abstractions.. (context) - Cardell - 1985
3
Lecture Notes In Computer Science (context) - Leroy, Dynamics et al. - 1991
2
Dynamic Typing in a Statically Typed Language ACM Transactio.. (context) - Abadi, Cardelli et al. - 1991
2
om Principles of Programming Languages (context) - Quasy-static, Prc - 1988
2
Fagan Soft Typing Proc (context) - Cartwright - 1991
2
and the -calculus Theoretical Computer Science (context) - Plotkin - 1975
2
Languages and Programming (context) - Type, partial et al. - 1988
1
Lecture Notes in Computer Science (context) - Dynamic, of et al. - 1992
1
Wright and Robert Cartwright A Practical Soft Type System fo.. (context) - Andrew - 1997
Documents on the same site (http://www.lania.mx/~aoliart/):
Fast Algorithms for Uniform Semi-Unification - Oliart, Snyder (1999)
(Correct)
An Extension of Baaz's Algorithm to E-semi-unification with One.. - Oliart
(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