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

DOI10.1007/3-540-58201-0_60zbMATH Open1422.68020OpenAlexW1533094895MaRDI QIDQ4632418FDOQ4632418

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

Recommendations

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

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)

Cites Work

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

Cited In (2)

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

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)