Semantic determinism and functional logic program properties
From MaRDI portal
Recommendations
Cites work
- An approach to declarative programming based on a rewriting logic
- Conditional rewriting logic as a unified model of concurrency
- scientific article; zbMATH DE number 1088020 (Why is no real title available?)
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Isabelle/HOL. A proof assistant for higher-order logic
- Logic Programming
- Non-determinism analyses in a parallel-functional language
- Nondeterministic algebraic specifications and nonconfluent term rewriting
Cited in
(8)- CurryCheck: checking properties of Curry programs
- Extra variables can be eliminated from functional logic programs
- Proving properties of functional programs by equality saturation
- scientific article; zbMATH DE number 5007864 (Why is no real title available?)
- scientific article; zbMATH DE number 549960 (Why is no real title available?)
- Default rules for Curry
- The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages
- Dynamic detection of determinism in functional logic languages
This page was built for publication: Semantic determinism and functional logic program properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864514)