Implementing polymorphic typing in a logic programming language

DOI10.1016/0096-0551(94)90012-4MaRDI QIDQ4301318zbMATH OpenOpenAlexFDO

Authors Keehang Kwon, Gopalan Nadathur, Debra Sue Wilson

Publication date 21 July 1994

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(94)90012-4

zbMATH Keywords

\(\lambda\) Prologlogic programming languagerun-time type checkingtypingWarren abstract machine

Mathematics Subject Classification ID

Logic programming (68N17) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• A treatment of higher-order features in logic programming
• Run-time type computations in the Warren Abstract machine
• A typed functional extension of logic programming
• A polymorphic type system for Prolog
• scientific article; zbMATH DE number 1497824

Cited in

(9)

• A typed functional extension of logic programming
• Combinatory logic with polymorphic types
• Executable relational specifications of polymorphic type systems using Prolog
• A treatment of higher-order features in logic programming
• Efficient run-time type checking of typed logic programs
• scientific article; zbMATH DE number 6307924 (Why is no real title available?)
• Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages
• A gradual polymorphic type system with subtyping for Prolog
• scientific article; zbMATH DE number 6304248 (Why is no real title available?)

This page was built for publication: Implementing polymorphic typing in a logic programming language

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