The system F of variable types, fifteen years later
Theoretical Computer Science
Theoretical Computer Science
Lambda-calculus, types and models
Lambda-calculus, types and models
Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
Linear Domains and Linear Maps
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Linear Metalanguage for Concurrency
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Disjunctive Tautologies as Synchronisation Schemes
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
Linear types and approximation
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
A Relational Model of a Parallel and Non-deterministic λ -Calculus
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
A Finiteness Structure on Resource Terms
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |
We show that the extensional collapse of the relational model of linear logic is the model of prime-algebraic complete lattices, a natural extension to linear logic of the well known Scott semantics of the lambda-calculus.