An analysis of the Core-ML language: expressive power and type reconstruction

DOI10.1007/3-540-58201-0_60MaRDI QIDQ4632418zbMATH OpenOpenAlexFDO

Authors Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson

Publication date 29 April 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58201-0_60

zbMATH Keywords

Turing machinerelational algebraexpressive powerinference ruleoperational semantics

Mathematics Subject Classification ID

Theory of programming languages (68N15) Database theory (68P15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• On the expressive power of finitely typed and universally polymorphic recursive procedures
• ML ^F
• Haskell overloading is DEXPTIME-complete
• scientific article; zbMATH DE number 125891
• Database query languages embedded in the typed lambda calculus

Cites work

• scientific article; zbMATH DE number 445159 (Why is no real title available?)
• scientific article; zbMATH DE number 4051569 (Why is no real title available?)
• scientific article; zbMATH DE number 125891 (Why is no real title available?)
• scientific article; zbMATH DE number 176206 (Why is no real title available?)
• scientific article; zbMATH DE number 176725 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 3561331 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A new recursion-theoretic characterization of the polytime functions
• A simple proof of a theorem of Statman
• A theory of type polymorphism in programming
• Database query languages embedded in the typed lambda calculus
• Datalog extensions for database queries and updates
• Definierbare Funktionen imλ-Kalkül mit Typen
• Horn clause queries and generalizations
• Intensional interpretations of functionals of finite type I
• On the complexity of queries in the logical data model
• On the expressive power of database queries with intermediate types
• On the sequential nature of unification
• Quantifier elimination and parametric polymorphism in programming languages
• Relational queries computable in polynomial time
• Structure and complexity of relational queries
• The Expressiveness of Simple and Second-Order Type Structures
• The complexity of type inference for higher-order typed lambda calculi
• The expressiveness of a family of finite set languages
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The typed lambda-calculus is not elementary recursive
• Why not negation by fixpoint?

Cited in

(2)

• Haskell overloading is DEXPTIME-complete
• On the expressive power of finitely typed and universally polymorphic recursive procedures

Describes a project that uses

Uses Software

• ML

This page was built for publication: An analysis of the Core-ML language: expressive power and type reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632418)