On the reification of semantic linearity
From MaRDI portal
Publication:5741580
Recommendations
Cites work
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 2238212 (Why is no real title available?)
- A stable programming language
- A theory of sequentiality
- BCK-combinators and linear \(\lambda\)-terms have types
- Computing with Functionals—Computability Theory or Computer Science?
- Definability and full abstraction
- Full abstraction for PCF
- Gödel's system \(\mathcal T\) revisited
- Linear Recursive Functions
- Linear logic
- On full abstraction for PCF: I, II and III
- Program equivalence in a linear functional language
- Sequential algorithms on concrete data structures
- Sequentiality in an extensional framework
- The Power of Linear Functions
- The sequentially realizable functionals
- The system \({\mathcal F}\) of variable types, fifteen years later
Cited in
(8)- A Process-Model for Linear Programs
- Quasi-linear Dialectica Extraction
- Linearity: a roadmap
- Linearity and PCF: a semantic insight!
- QPCF: higher-order languages and quantum circuits
- \textsc{qPCF}: a language for quantum circuit computations
- A forgotten strand of reception history: understanding pure semantics
- Semantic Barbs and Biorthogonality
This page was built for publication: On the reification of semantic linearity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741580)