The system F of variable types, fifteen years later
Theoretical Computer Science
Full abstraction for sequential algorithms: the state of the art
Algebraic methods in semantics
Theoretical Computer Science
Proofs and types
Categories, types, and structures: an introduction to category theory for the working computer scientist
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
Fully abstract semantics for observably sequential languages
Information and Computation
Sequentiality in an extensional framework
Papers presented at the IEEE symposium on Logic in computer science
Hypercoherences: a strongly stable model of linear logic
Proceedings of the workshop on Advances in linear logic
Correspondence between operational and denotational semantics: the full abstraction problem for PCF
Handbook of logic in computer science (vol. 4)
Pi-calculus, dialogue games and full abstraction PCF
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Operational interpretations of linear logic
Theoretical Computer Science - Special issue on linear logic, 1
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A type theory for memory allocation and data layout
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Strong normalisation in the π-calculus
Information and Computation
The Geometry of Linear Higher-Order Recursion
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A Process-Model for Linear Programs
Types for Proofs and Programs
Theoretical Computer Science
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
We propose a paradigmatic programming language (called SlPCF) which is linear in a semantic sense. SlPCF is not syntactically linear, namely its programs can contain more than one occurrencies of the same variable. We give an interpretation of SlPCF into a model of linear coherence spaces and we show that such semantics is fully abstract with respect to our language. Furthermore, we discuss the independence of new syntactical operators and we address the universality problem.