FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
On functors expressible in the polymorphic typed lambda calculus
Information and Computation
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
When is a functional program not a functional program?
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
A faster solver for general systems of equations
Science of Computer Programming
On full abstraction for PCF: I, II, and III
Information and Computation
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Lazy Functional Algorithms for Exact Real Functionals
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Universal Top-Down Fixpoint Algorithm
A Universal Top-Down Fixpoint Algorithm
Free theorems involving type constructor classes: functional pearl
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Verifying a local generic solver in coq
SAS'10 Proceedings of the 17th international conference on Static analysis
A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
| Hi-index | 0.00 |
How can one rigorously specify that a given ML functional $f : (\texttt{int} \to \texttt{int}) \to \texttt{int}$ is pure, i.e., f produces no computational effects except those produced by evaluation of its functional argument? In this paper, we introduce a semantic notion of monadic parametricity for second-order functionals which is a form of purity. We show that every monadically parametric f admits a question-answer strategy tree representation. We discuss possible applications of this notion, e.g., to the verification of generic fixpoint algorithms. The results are presented in two settings: a total set-theoretic setting and a partial domain-theoretic one. All proofs are formalized by means of the proof assistant Coq.