A Formalization of the Semantics of Functional-Logic Programming in Isabelle

Details A Formalization of the Semantics of Functional-Logic Programming in Isabelle A Formalization of the Semantics of Functional-Logic Programming in Isabelle

2009-08-04

arxiv.org/abs/0908.0494v1

22nd International Conference Theorem Proving for Higher-Order Logics (TPHOLs 2009): emerging trends session (2009)

Computer Science

Logic in Computer Science

Scientific paper

Modern functional-logic programming languages like Toy or Curry feature non-strict non-deterministic functions that behave under call-time choice semantics. A standard formulation for this semantics is the CRWL logic, that specifies a proof calculus for computing the set of possible results for each expression. In this paper we present a formalization of that calculus in the Isabelle/HOL proof assistant. We have proved some basic properties of CRWL: closedness under c-substitutions, polarity and compositionality. We also discuss some insights that have been gained, such as the fact that left linearity of program rules is not needed for any of these results to hold.

Affiliated with

Also associated with

No associations

Rating

A Formalization of the Semantics of Functional-Logic Programming in Isabelle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Formalization of the Semantics of Functional-Logic Programming in Isabelle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Formalization of the Semantics of Functional-Logic Programming in Isabelle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557552