Executable Relational Specifications of Polymorphic Type Systems Using Prolog

DOI10.1007/978-3-319-29604-3_8zbMath1475.68052OpenAlexW2395886377MaRDI QIDQ2798266

Andrea Vezzosi, Ki Yung Ahn

Publication date: 4 April 2016

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29604-3_8

zbMATH Keywords

unificationlogic programmingtype systemPrologfunctional languagetype inferenceparametric polymorphismalgebraic datatypedelayed goalshigher-kind polymorphismHindley-Milnernested datatypetype constructor polymorphism

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Uses Software

• GHC
• miniKanren
• KANREN
• Teyjus
• AIspace

Cites Work

• Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Type Inference using Constraint Handling Rules
• First-order unification by structural recursion
• Artificial Intelligence
• Introduction to generalized type systems
• A hierarchy of mendler style recursion combinators
• System F i
• Logic Programming
• Static Type Inference for the Q language using Constraint Logic Programming
• Delimited continuations for prolog
• Towards Typed Prolog
• A Type-Theoretic Approach to Resolution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Executable Relational Specifications of Polymorphic Type Systems Using Prolog