FlatCurry: An intermediate representation for Curry programs. In order to provide a common interface for connecting different tools working on Curry programs or programs written in another (functional logic) declarative language (e.g., Toy), there is an intermediate language, called FlatCurry, for representing functional logic programs. This document provides an overview about the ideas and structure of FlatCurry.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Dylus, Sandra; Christiansen, Jan; Teegen, Finn: Implementing a library for probabilistic programming using non-strict non-determinism (2020)
- Sandra Dylus, Jan Christiansen, Finn Teegen: Implementing a Library for Probabilistic Programming using Non-strict Non-determinism (2019) arXiv
- Christiansen, Jan; Seidel, Daniel; Voigtländer, Janis: An adequate, denotational, functional-style semantics for typed FlatCurry (2011)
- Mariño, Julio (ed.): Functional and constraint logic programming. 19th international workshop, WFLP 2010, Madrid, Spain, January 17, 2010. Revised selected papers (2011)