Peter Lee, Mark Leone, Spiro Michaylov, Frank Pfenning  Home/Search
Context Related
| cmu.edu/user/mleone/papers/leap.ps 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: cmu.edu/people/mleone/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Peter Lee, Mark Leone, Spiro Michaylov, and Frank Pfenning School of Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213-3890, U.S.A. 1 Introduction The value of polymorphism in programming languages has been demonstrated by languages such as ML [19]. Recent efficient implementations of ML have shown that a language with implicit polymorphism can be practical [1]. The core of ML's type system is limited, however, by the fact that only instances of polymorphic... (Update)
Similar documents based on text: More All
0.5: Programming in Higher-Order Typed Lambda-Calculi - Pierce, Dietzen, Michaylov (1989) (Correct)
0.2: An Empirical Study of the Runtime Behavior of Higher-Order.. - Michaylov, Pfenning (1992) (Correct)
0.1: Higher-Order Logic Programming as Constraint Logic Programming - Michaylov, Pfenning (1993) (Correct)
BibTeX entry: (Update)
P. Lee, M. Leone, S. Michaylov, and F. Pfenning. Towards a Practical Programming Language Based on the Polymorphic Lambda Calculus. Technical report, School of Computer Science, Carnegie Mellon University, November 1989. Ergo Project Report ERGO-89-085. http://citeseer.ist.psu.edu/lee89towards.html More
@misc{ lee89towards,
author = "P. Lee and M. Leone and S. Michaylov and F. Pfenning",
title = "Towards a Practical Programming Language Based on the Polymorphic Lambda
Calculus",
text = "P. Lee, M. Leone, S. Michaylov, and F. Pfenning. Towards a Practical Programming
Language Based on the Polymorphic Lambda Calculus. Technical report, School
of Computer Science, Carnegie Mellon University, November 1989. Ergo Project
Report ERGO-89-085.",
year = "1989",
url = "citeseer.ist.psu.edu/lee89towards.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
266 Information and Computation (context) - Coquand, Huet et al. - 1988
172 Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
160 The principal type-scheme of an object in combinatory logic (context) - Hindley - 1969
101 Higher-order logic programming - Miller, Nadathur - 1986
89 closure-passing style (context) - Appel, Jim - 1989
63 Three approaches to type structure (context) - Reynolds - 1985
60 ACM Transactions on Programming Languages and Systems (context) - Donahue, Demers et al. - 1985
54 Partial polymorphic type inference and higher-order unificat.. (context) - Pfenning - 1988
53 Automatic synthesis of typed 3-programs on term algebras (context) - Bohm, Berarducci - 1985
53 Digital Equipment Corporation (context) - Cardelli, Technical - 1989
40 Interpr'etation fonctionelle et 'elimination des coupures de.. (context) - Girard - 1972
37 A kernel language for abstract data types and modules (context) - Burstall, Lampson - 1984
35 Modules for Standard ML - MacQueen - 1985
31 Contracting proofs to programs (context) - Leivant - 1990
[Article contains additional citations not shown here]
Documents on the same site (http://foxnet.cs.cmu.edu/people/mleone/research.html):
A Declarative Approach to Run-Time Code Generation - Mark Leone (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