Towards Typed Prolog

DOI10.1007/978-3-540-89982-2_59zbMath1185.68181OpenAlexW1509799693WikidataQ56059066 ScholiaQ56059066MaRDI QIDQ5504693

Tom Schrijvers, Jan Wielemaker, Bart Demoen, Vitor Costa

Publication date: 22 January 2009

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/197561

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (11)

From Logic to Functional Logic Programs ⋮ Pre-indexed Terms for Prolog ⋮ VeriFly: On-the-fly Assertion Checking via Incrementality ⋮ Fifty Years of Prolog and Beyond ⋮ Data type inference for logic programming ⋮ Typed SLD-resolution: dynamic typing for logic programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control ⋮ Concolic Testing in CLP ⋮ Executable Relational Specifications of Polymorphic Type Systems Using Prolog

Uses Software

• ML
• YAP-Prolog
• Mercury

Cites Work

• A polymorphic type system for Prolog
• A theory of type polymorphism in programming
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Unnamed Item

This page was built for publication: Towards Typed Prolog