Abstract
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be derived without consulting function definitions. Is the same possible in a strongly, and polymorphically, typed functional logic language? This is the question we study in this paper. Logical features like nondeterminism and free variables cause interesting effects, which we examine based on examples and address by identifying appropriate conditions that guarantee standard free theorems or inequational versions thereof to hold. We see this case study as a stepping stone for a general theory, not provided here, involving the definition of a logical relation and other machinery required for parametricity arguments appropriate to functional logic languages.
Index Terms
- Free theorems for functional logic programs: (abstract only)
Recommendations
Free theorems for functional logic programs
PLPV '10: Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verificationType-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be derived without consulting function definitions. Is the same possible in a ...
Strengthening Brady's Paraconsistent 4-Valued Logic BN4 with Truth-Functional Modal Operators
ukasiewicz presented two different analyses of modal notions by means of many-valued logics: (1) the linearly ordered systems 3,..., [InlineEquation not available: see fulltext.] ,..., $$\hbox {L}_{\omega }$$L ; (2) the 4-valued logic he defined in the ...
Comments