FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
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
Incremental analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
GENA - A Tool for Generating Prolog Analyzers from Specifications
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Flow Logics for Constraint Based Analysis
CC '98 Proceedings of the 7th International Conference on Compiler Construction
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
Checking Well-Formedness of Pure-Method Specifications
FM '08 Proceedings of the 15th international symposium on Formal Methods
Region Analysis for Race Detection
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Verifying a local generic solver in coq
SAS'10 Proceedings of the 17th international conference on Static analysis
On monadic parametricity of second-order functionals
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
How to combine widening and narrowing for non-monotonic systems of equations
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
Given an ML function f : (int → int) → int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its functional argument? We show that existing methods based on preservation of invariants and relational parametricity are insufficient for this purpose and thus define a new notion that captures purity in the sense that for any functional F that is pure in this sense there exists a corresponding question-answer strategy. This research is motivated by an attempt to prove algorithms correct that take such supposedly pure functionals as input and apply them to stateful arguments in order to inspect intensional aspects of their behaviour.