Refinement of a typed WAM extension by polymorphic order-sorted types

DOI10.1007/BF01211908zbMath0876.68019MaRDI QIDQ1816918

Egon Börger, Christoph Beierle

Publication date: 1 December 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

constraint logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (3)

Abstract state machines: a unifying view of models of computation and of system design frameworks ⋮ Specification and correctness proof of a WAM extension with abstract type constraints ⋮ Semantic splitting of conditional belief bases

Uses Software

• PROTOS-L

Cites Work

• A polymorphic type system for Prolog
• Horn clause programs with polymorphic types: Semantics and resolution
• Specification and correctness proof of a WAM extension with abstract type constraints
• Run-time type computations in the Warren Abstract machine
• Unnamed Item
• Unnamed Item

This page was built for publication: Refinement of a typed WAM extension by polymorphic order-sorted types