Run-time type computations in the Warren Abstract machine

DOI10.1016/0743-1066(94)90049-3zbMATH Open0795.68034OpenAlexW2031532267MaRDI QIDQ4285642FDOQ4285642

Authors: C. Beierle, Gregor Meyer 

Publication date: 24 March 1994

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

Full work available at URL: https://doi.org/10.1016/0743-1066(94)90049-3

Recommendations

• scientific article; zbMATH DE number 3995030
• A verified prolog compiler for the Warren Abstract Machine
• An abstract concurrent machine for rewriting
• Optimizing abstract abstract machines
• Witness Runs for Counter Machines
• scientific article; zbMATH DE number 1549510
• Polynomial runtime and composability
• Abstracting abstract machines

zbMATH Keywords

Warren abstract machinelogic programming language PROTOS-L

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (5)

• A complete semantics of \(\mathbb{K}\) and its translation to Isabelle
• Specification and correctness proof of a WAM extension with abstract type constraints
• Refinement of a typed WAM extension by polymorphic order-sorted types
• Witness Runs for Counter Machines
• Implementing polymorphic typing in a logic programming language

Uses Software

• PROTOS-L

This page was built for publication: Run-time type computations in the Warren Abstract machine

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