The following pages link to (Q4281466):
Displaying 40 items.
- Categories for computation in context and unified logic (Q678833) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Synthetic domain theory and models of linear Abadi {\&} Plotkin logic (Q952487) (← links)
- An internal language for autonomous categories (Q1320337) (← links)
- New Curry-Howard terms for full linear logic (Q1390952) (← links)
- A general adequacy result for a linear functional language (Q1391860) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- A linear logical framework (Q1400718) (← links)
- On categorical equivalence of Gentzen-style derivations in IMLL (Q1401367) (← links)
- Relating categorical semantics for intuitionistic linear logic (Q1781095) (← links)
- Semantical analysis of contextual types (Q2200843) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs (Q2278834) (← links)
- Coherence in SMCCs and equivalences on derivations in IMML with unit (Q2373695) (← links)
- Weak linearization of the lambda calculus (Q2566028) (← links)
- An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine (Q2841304) (← links)
- Covert Movement in Logical Grammar (Q3013021) (← links)
- Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
- Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)
- Execution time of λ-terms via denotational semantics and intersection types (Q4577984) (← links)
- A Type Theory for Probabilistic and Bayesian Reasoning (Q4580222) (← links)
- Non-normal modalities in variants of linear logic (Q4586144) (← links)
- A model of intuitionistic affine logic from stable domain theory (Q4632438) (← links)
- A linear/producer/consumer model of classical linear logic (Q4637629) (← links)
- (Q5015209) (← links)
- (Q5018484) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- (Q5020970) (← links)
- A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types (Q5056372) (← links)
- (Q5119390) (← links)
- Encodings of Turing machines in linear logic (Q5139286) (← links)
- Classical lambda calculus in modern dress (Q5269006) (← links)
- Linear Logic Properly Displayed (Q5886520) (← links)
- Proof theory in the abstract (Q5957852) (← links)
- Two applications of analytic functors (Q5958294) (← links)
- Focused linear logic and the \(\lambda\)-calculus (Q5971394) (← links)
- Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic (Q6060672) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
