Semantic determinism and functional logic program properties
DOI10.1016/J.ENTCS.2006.10.018zbMATH Open1277.68048OpenAlexW2032660789MaRDI QIDQ2864514FDOQ2864514
Authors: José Miguel Cleva, F. J. López-Fraguas 
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.018
Recommendations
Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)
Cites Work
- Isabelle/HOL. A proof assistant for higher-order logic
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Conditional rewriting logic as a unified model of concurrency
- Non-determinism analyses in a parallel-functional language
- Logic Programming
- Title not available (Why is that?)
- An approach to declarative programming based on a rewriting logic
- Nondeterministic algebraic specifications and nonconfluent term rewriting
Cited In (6)
- Proving properties of functional programs by equality saturation
- Title not available (Why is that?)
- The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages
- Extra variables can be eliminated from functional logic programs
- CurryCheck: checking properties of Curry programs
- Default rules for Curry
Uses Software
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)
