Paris Kanellakis, Gerd Hillebrand, Harry Mairson  Home/Search
Context Related
| wwwipd.ira.uka.de/~ggh/pa...KHM94.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: wwwipd.ira.uka.de/~ggh/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Core-ML is a basic subset of most functional programming languages. It consists of the simply typed (or monomorphic) -calculus, simply typed equality over atomic constants, and let as the only polymorphic construct. We present a synthesis of recent results which characterize this "toy" language's expressive power as well as its type reconstruction (or type inference) problem. More specifically: (1) Core-ML can express exactly the ELEMENTARY queries, where a program input is a database... (Update)
Context of citations to this paper: More
...] is typable in System I k iff M accepts x. Following the earlier, similar proof for ML and bounded kind generalizations of System F [KHM94, HM94], we are thus able to simulate computations faithfully in the types. The key idea is that, in the calculus simulation of...
...stating the same result and providing an independent (and more direct) proof of it. More refined and simplified proofs appeared later in [7, 16, 17]. The problem why theory diverged from practice needed further elaboration. One possible solution has been suggested by Gerd G....
Cited by: More
LAL Is Square: Representation and Expressiveness in Light.. - Neergaard, Mairson (2002) (Correct)
Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
Reflections on complexity of ML type reconstruction - Wierzbicki (1997) (Correct)
Similar documents (at the sentence level):
17.8%: Functional Database Query Languages as Typed Lambda Calculi.. - Hillebrand, al. (1994) (Correct)
6.8%: Functional Database Query Languages as Typed Lambda.. - Hillebrand, Kanellakis (1994) (Correct)
Active bibliography (related documents): More All
1.9: An Analysis of the Core-ML Language: Expressive Power .. - Kanellakis.. (1994) (Correct)
1.1: On the Expressive Power of Simply Typed and.. - Hillebrand, Kanellakis (1996) (Correct)
1.1: Database Query Languages Embedded in the Typed Lambda.. - Hillebrand, Kanellakis.. (1993) (Correct)
Similar documents based on text: More All
0.4: Functional Programming Formalisms for OODB Methods - Hillebrand, Kanellakis.. (1994) (Correct)
0.4: Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand (1994) (Correct)
0.4: Unification and ML Type Reconstruction - Kanellakis, Mairson, Mitchell (1991) (Correct)
Related documents from co-citation: More All
4: The typed lambda calculus is not elementary recursive (context) - Statman - 1979
4: Deciding ML typability is complete for deterministic exponential time (context) - Mairson - 1990
4: The complexity of type inference for higher-order typed lambda-calculi - Henglein, Mairson - 1991
BibTeX entry: (Update)
P. C. Kanellakis, G. G. Hillebrand, and H. G. Mairson. An analysis of the Core-ML language: Expressive power and type reconstruction. In 21st Int'l Colloq. on Automata, Languages, and Programming, vol. 820 of LNCS, pp. 83--106, 1994. Invited paper. http://citeseer.ist.psu.edu/kanellakis94analysis.html More
@inproceedings{ kanellakis94analysis,
author = "Paris C. Kanellakis and Gerd G. Hillebrand and Harry G. Mairson",
title = "An Analysis of the Core-{ML} Language: Expressive Power and Type Reconstruction",
booktitle = "Automata, Languages and Programming",
pages = "83-105",
year = "1994",
url = "citeseer.ist.psu.edu/kanellakis94analysis.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
809 A Theory of Type Polymorphism in Programming (context) - Milner - 1978
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
634 A Machine Oriented Logic Based on the Resolution Principle (context) - Robinson - 1965
379 The Complexity of Relational Query Languages (context) - Vardi - 1982
343 Principal Type Schemes for Functional Programs (context) - Damas, Milner - 1982
325 Towards a Theory of Type Structure (context) - Reynolds
210 Generalized First-Order Spectra and Polynomial-Time Recogniz.. (context) - Fagin - 1974
198 Structure and Complexity of Relational Queries - Chandra, Harel - 1982
185 The Calculi of Lambda-Conversion (context) - Church - 1941
129 the Power of Languages for the Manipulation of Complex Objec.. - Abiteboul, Beeri - 1988
124 Datalog Extensions for Database Queries and Updates (context) - Abiteboul, Vianu - 1991
121 Intensional Interpretation of Functionals of Finite Type (context) - Tait - 1967
108 Relational Completeness of Database Sublanguages (context) - Codd - 1972
106 Naturally Embedded Query Languages (context) - Breazu-Tannen, Buneman et al. - 1992
96 A New Recursion-Theoretic Characterization of the Polytime F.. (context) - Bellantoni, Cook - 1992
90 Horn Clause Queries and Generalizations (context) - Chandra, Harel - 1985
65 Why Not Negation By Fixpoint (context) - Kolaitis, Papadimitriou - 1991
65 The Circuit Value Problem is Logspace Complete for P (context) - Ladner - 1975
63 Optimal Reductions in the Lambda-Calculus (context) - L'evy - 1980
59 An Analysis of ML Typability (context) - Kfoury, Tiuryn et al. - 1990
55 A Simple Algorithm and Proof for Type Inference (context) - Wand - 1987
51 the Sequential Nature of Unification (context) - Dwork, Kanellakis et al. - 1984
44 the Expressive Power of Database Queries with Intermediate T.. (context) - Hull, Su - 1991
43 The Definition of Standard ML (context) - Harper, Milner et al. - 1990
39 Logical and Computational Aspect Programming with SetBagList - Tannen, Logical et al. - 1991
39 Bounded Linear Logic: A Modular Approach to Polynomial Time .. (context) - Girard, Scedrov et al. - 1990
39 Algebras of Feasible Functions (context) - Gurevich - 1983
38 The Intrinsic Computational Difficulty of Functions (context) - Cobham - 1964
32 Unification and ML-type Reconstruction - Kanellakis, Mairson et al.
29 ese de Doctorat d (context) - Girard, et et al. - 1972
27 The Expressiveness of a Family of Finite Set Languages - Immerman, Patnaik et al. - 1991
26 Lambda Calculus Characterizations of Poly-Time (context) - Leivant, Marion - 1993
25 Database Query Languages Embedded in the Typed Lambda Calcul.. - Hillebrand, Kanellakis et al. - 1993
24 The Complexity of Type Inference for HigherOrder Typed Lambd.. - Henglein, Mairson - 1991
22 The Expressiveness of Simple and Second-Order Type Structure.. (context) - Fortune, Leivant et al. - 1983
21 A Simple Proof of a Theorem of Statman - Mairson - 1992
20 The Typed -Calculus is not Elementary Recursive (context) - Statman - 1979
18 The Inherent Computational Complexity of Theories of Ordered.. (context) - Meyer - 1974
18 the Complexity of Queries in the Logical Data Model - Kuper, Vardi - 1993
16 Database Theory Column: Query Languages for Complex Object D.. (context) - Abiteboul, Kanellakis - 1990
15 Structural Recursion as a Query Language - Breazu-Tannen, Buneman et al. - 1991
13 Functional Database Query Languages as Typed Lambda Calculi .. - Hillebrand, Kanellakis - 1994
12 Definierbare Funktionen im -Kalkul mit Typen (context) - Schwichtenberg - 1976
8 Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand - 1994
8 The Hierarchy of Finitely Typed Functional Programs (context) - Kfoury, Tiuryn et al. - 1987
5 Quantifier Elimination and Parametric Polymorphism in Progra.. - Mairson - 1992
2 Relational Queries Computable in PTIME (context) - Immerman - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wwwipd.ira.uka.de/~ggh/): More
Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand (1994) (Correct)
Undecidable Boundedness Problems for Datalog Programs - Gerd Hillebrand Paris (1995) (Correct)
Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand (1994) (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