Theoretical Computer Science
Is there a use for linear logic?
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Research topics in functional programming
Linearity and laziness
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Proving congruence of bisimulation in functional programming languages
Information and Computation
A general adequacy result for a linear functional language
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Compiling standard ML to Java bytecodes
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Higher order operational techniques in semantics
Higher order operational techniques in semantics
Call-by-name call-by-value, call-by-need and the linear lambda calculus
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
The Girard Translation Extended with Recursion
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Linear Logic, Monads and the Lambda Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Lightweight linear types in system f°
Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Relational parametricity for a polymorphic linear lambda calculus
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Researchers have recently proposed that for certain applications it is advantageous to use functional languages whose type systems are based upon linear logic: so-called linear functional languages. In this paper we develop reasoning techniques for programs in a linear functional language, linPCF, based on their operational behaviour. The principal theorem of this paper is to show that contextual equivalence of linPCF programs can be characterised coinductively. This characterisation provides a tractable method for reasoning about contextual equivalence, and is used in three ways:• A number of useful contextual equivalences between linPCF programs is given.• A notion of type isomorphism with respect to contextual equivalence, called operational isomorphism, is given. In particular the types !Φ⊗!ψ and !(Φ&ψ) are proved to be operationally isomorphic.• A translation of non-strict PCF into linPCF is shown to be adequate, but not fully abstract, with respect to contextual equivalence.