The system F of variable types, fifteen years later
Theoretical Computer Science
Theoretical Computer Science
Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The differential Lambda-calculus
Theoretical Computer Science
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
Theoretical Computer Science
A denotational semantics for the symmetric interaction combinators
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Algebraic Totality, towards Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Differential Linear Logic and Polarization
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
An Explicit Formula for the Free Exponential Modality of Linear Logic
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Differential structure in models of multiplicative biadditive intuitionistic linear logic
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
The separation theorem for differential interaction nets
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On linear combinations of λ-terms
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
Confluence of pure differential nets with promotion
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Categorical Models for Simply Typed Resource Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
Non-uniform (hyper/multi)coherence spaces
Mathematical Structures in Computer Science
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Probabilistic coherence spaces are fully abstract for probabilistic PCF
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Applying quantitative semantics to higher-order quantum computing
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Weighted Relational Models of Typed Lambda-Calculi
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We investigate a new denotational model of linear logic based on the purely relational model. In this semantics, webs are equipped with a notion of ‘finitary’ subsets satisfying a closure condition and proofs are interpreted as finitary sets. In spite of a formal similarity, this model is quite different from the usual models of linear logic (coherence semantics, hypercoherence semantics, the various existing game semantics…). In particular, the standard fix-point operators used for defining the general recursive functions are not finitary, although the primitive recursion operators are. This model can be considered as a discrete analogue of the Köthe space semantics introduced in a previous paper: we show how, given a field, each finiteness space gives rise to a vector space endowed with a linear topology, a notion introduced by Lefschetz in 1942, and we study the corresponding model where morphisms are linear continuous maps (a version of Girard's quantitative semantics with coefficients in the field). In this way we obtain a new model of the recently introduced differential lambda-calculus.