Towards Typed Prolog
From MaRDI portal
Recommendations
Cites work
Cited in
(20)- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Typed static analysis: Application to the groundness analysis of typed prolog
- Executable relational specifications of polymorphic type systems using Prolog
- Type inference for mobile ambients in Prolog
- Static type checking for the Q functional language in Prolog
- Pre-indexed Terms for Prolog
- scientific article; zbMATH DE number 4092733 (Why is no real title available?)
- scientific article; zbMATH DE number 67966 (Why is no real title available?)
- Type analysis of prolog using type graphs
- scientific article; zbMATH DE number 7453099 (Why is no real title available?)
- A three-valued semantics for typed logic programming
- From Logic to Functional Logic Programs
- Concolic testing in CLP
- Static type inference for the Q language using constraint logic programming
- A gradual polymorphic type system with subtyping 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
- A polymorphic type system for Prolog
This page was built for publication: Towards Typed Prolog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504693)