Journal of Information Processing and Cybernetics
Lambda-calculus, types and models
Lambda-calculus, types and models
Information and Computation
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
An Axiomatic System of Parametricity
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Linear logic and elementary time
Information and Computation - Special issue: ICC '99
The Girard—Reynolds isomorphism (second edition)
Theoretical Computer Science
Reasoning about functional programs and complexity classes associated with type disciplines
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Realizability and parametricity in pure type systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
| Hi-index | 0.00 |
We present two refinements, based on program extraction in elementary affine logic and light affine logic, of Krivine & Leivant's system FA2. This system allows higher-order equations to specify the computational content of extracted programs. The user can then prove a generic formula, using these equations as axioms. The system guarantees that the extracted program satisfies the specification and is computable in elementary time (for elementary affine logic) or polynomial time (for light affine logic). Finally, we show that both systems are complete with respect to elementary time and polynomial time functions.