On the public citation graph

A mixed linear and non-linear logic: Proofs, terms and models

https://doi.org/10.1007/bfb0022251
0 signed · 215 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-56992-8_6openalex-snapshot
Linear λ-calculus and categorical models revisited
inferredcites →https://doi.org/10.1007/3-540-57182-5_12openalex-snapshot
A taste of linear logic
inferredcites →https://doi.org/10.1007/3-540-57529-4_42openalex-snapshot
Conventional and uniqueness typing in graph rewrite systems
inferredcites →https://doi.org/10.1007/bfb0022251openalex-snapshot
A mixed linear and non-linear logic: Proofs, terms and models
inferredcites →https://doi.org/10.1007/bfb0037099openalex-snapshot
A term calculus for Intuitionistic Linear Logic
inferredcites →https://doi.org/10.1016/0168-0072(93)90093-sopenalex-snapshot
On the unity of logic
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1017/s0956796800001246openalex-snapshot
Strong normalisation for the linear term calculus
inferredcites →https://doi.org/10.1090/conm/092/1003210openalex-snapshot
Linear logic, *-autonomous categories and cofree coalgebras
inferredcites →https://doi.org/10.1109/lics.1992.185536openalex-snapshot
Operational aspects of linear lambda calculus

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11787006_32openalex-snapshot
Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
inferred← citeshttps://doi.org/10.1007/11874683openalex-snapshot
Computer Science Logic
inferred← citeshttps://doi.org/10.1007/11874683_1openalex-snapshot
Functorial Boxes in String Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_26openalex-snapshot
Finite Models and Full Completeness
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_31openalex-snapshot
Classical Linear Logic of Implications
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_15openalex-snapshot
Categorical Models for Intuitionistic and Linear Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_17openalex-snapshot
Kripke Resource Models of a Dependently-Typed, Bunched λ-Calculus (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_15openalex-snapshot
Logical Predicates for Intuitionistic Linear Type Theories
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_19openalex-snapshot
Resource Interpretations, Bunched Implications and the αλ-Calculus (Preliminary Version)
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_14openalex-snapshot
Categorical Models of Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_52openalex-snapshot
A type-free resource-aware λ-calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_22openalex-snapshot
Manifest Deadlock-Freedom for Shared Session Types
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_23openalex-snapshot
A Categorical Model of an $$\mathbf {i/o}$$ -typed $$\pi $$ -calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-52482-1_10openalex-snapshot
Fractional Types
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_15openalex-snapshot
Adjoint Reactive GUI Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_22openalex-snapshot
Reverse AD at Higher Types: Pure, Principled and Denotationally Correct
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_13openalex-snapshot
Linearity and Uniqueness: An Entente Cordiale
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_14openalex-snapshot
A Framework for Substructural Type Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_26openalex-snapshot
Semantics for a Lambda Calculus for String Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_16openalex-snapshot
Safe Session-Based Concurrency with Shared Linear State
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_19openalex-snapshot
Type-safe Quantum Programming in Idris
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_7openalex-snapshot
Modal Crash Types for Intermittent Computing
inferred← citeshttps://doi.org/10.1007/978-3-031-35361-1_1openalex-snapshot
Relating Message Passing and Shared Memory, Proof-Theoretically
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_9openalex-snapshot
The Session Abstract Machine
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_6openalex-snapshot
Ordered Adjoint Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_14openalex-snapshot
Formalized, Effective Domain Theory in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_26openalex-snapshot
Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_16openalex-snapshot
Adjoint Logic with a 2-Category of Modes
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_7openalex-snapshot
Multiple Conclusion Linear Logic: Cut Elimination and More
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_7openalex-snapshot
Depending on Session-Typed Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_8openalex-snapshot
Fab ous Interoperability for ML and a Linear Language
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_29openalex-snapshot
On Polymorphic Sessions and Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_17openalex-snapshot
Semantics of Linear Continuation-Passing in Call-by-Name
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_25openalex-snapshot
Full Abstraction for HOPLA
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_13openalex-snapshot
Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_32openalex-snapshot
Linear Realizability
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_7openalex-snapshot
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-89330-1_9openalex-snapshot
Extensional Universal Types for Call-by-Value
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_19openalex-snapshot
Enriching an Effect Calculus with Linear Types
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_29openalex-snapshot
Stateful Contracts for Affine Types
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_3openalex-snapshot
Linearly-Used Continuations in the Enriched Effect Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_20openalex-snapshot
Higher-Order Processes, Functions, and Sessions: A Monadic Integration
inferred← citeshttps://doi.org/10.1007/978-3-642-38164-5_13openalex-snapshot
Presheaf Models of Quantum Computation: An Outline
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_1openalex-snapshot
Polarized Substructural Session Types
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_3openalex-snapshot
Dependent Types and Fibred Computational Effects
inferred← citeshttps://doi.org/10.1007/978-94-017-8813-7_11openalex-snapshot
Towards Computational Non-associative Lambek Lambda-Calculi for Formal Pragmatics
inferred← citeshttps://doi.org/10.1007/978-981-92-0184-6_1openalex-snapshot
Finite Functional Programming
inferred← citeshttps://doi.org/10.1007/bfb0014046openalex-snapshot
What is a categorical model of Intuitionistic Linear Logic?
inferred← citeshttps://doi.org/10.1007/bfb0014569openalex-snapshot
Types and models for higher-order action calculi
inferred← citeshttps://doi.org/10.1007/bfb0028008openalex-snapshot
From action calculi to linear logic
inferred← citeshttps://doi.org/10.1007/s10485-004-3134-zopenalex-snapshot
Relating Categorical Semantics for Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.1007/s10485-020-09598-7openalex-snapshot
A Categorical Construction for the Computational Definition of Vector Spaces
inferred← citeshttps://doi.org/10.1007/s10485-021-09649-7openalex-snapshot
Cartesian Differential Categories as Skew Enriched Categories
inferred← citeshttps://doi.org/10.1007/s10485-026-09877-9openalex-snapshot
Enriched Categorical Semantics for Intuitionistic Subexponential Linear Logic (ISELL): Initial-Model Completeness
inferred← citeshttps://doi.org/10.1007/s40509-025-00368-5openalex-snapshot
The quantum monadology
inferred← citeshttps://doi.org/10.1016/0304-3975(96)80138-1openalex-snapshot
Syntactic control of interference revisited
inferred← citeshttps://doi.org/10.1016/j.aim.2023.108900openalex-snapshot
Sheaf representation of monoidal categories
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.018openalex-snapshot
Resource modalities in tensor logic
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.010openalex-snapshot
Semantics of higher-order quantum computation via geometry of interaction
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.099openalex-snapshot
An Algebraic Account of References in Game Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.06.010openalex-snapshot
Fibrational Modal Type Theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.11.015openalex-snapshot
Modality via Iterated Enrichment
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.07.006openalex-snapshot
A Concrete Categorical Semantics of Lambda- S
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.008openalex-snapshot
Parametrized Fixed Points and Their Applications to Session Types
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.006openalex-snapshot
An abstract approach to stratification in linear logic
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100637openalex-snapshot
A message-passing interpretation of adjoint logic
inferred← citeshttps://doi.org/10.1016/j.scico.2007.11.005openalex-snapshot
The logic of message-passing
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.013openalex-snapshot
Two-level languages for program optimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.029openalex-snapshot
Domain theory for concurrency
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.023openalex-snapshot
Musings around the geometry of interaction, and coherence
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00355-7openalex-snapshot
Closed action calculi
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00048-1openalex-snapshot
A classical linear λ-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00026-xopenalex-snapshot
Syntactic Control of Interference Revisited
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00101-xopenalex-snapshot
Local Realizability Toposes and a Modal Logic for Computability
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80175-6openalex-snapshot
A Derivation System for Uniqueness Typing
inferred← citeshttps://doi.org/10.1017/bsl.2023.14openalex-snapshot
UNDER LOCK AND KEY: A PROOF SYSTEM FOR A MULTIMODAL LOGIC
inferred← citeshttps://doi.org/10.1017/cbo9781139193313.005openalex-snapshot
Quantum Lambda Calculus
inferred← citeshttps://doi.org/10.1017/s0956796802004495openalex-snapshot
On bunched typing
inferred← citeshttps://doi.org/10.1017/s095679680999027xopenalex-snapshot
The arrow calculus
inferred← citeshttps://doi.org/10.1017/s0956796822000016openalex-snapshot
Back to futures
inferred← citeshttps://doi.org/10.1017/s0956796824000030openalex-snapshot
Asymptotic speedup via effect handlers
inferred← citeshttps://doi.org/10.1017/s0956796898002998openalex-snapshot
Computational types from a logical perspective
inferred← citeshttps://doi.org/10.1017/s0956796899003615openalex-snapshot
Girard translation and logical predicates
inferred← citeshttps://doi.org/10.1017/s0960129500003200openalex-snapshot
Linear types and approximation
inferred← citeshttps://doi.org/10.1017/s0960129504004621openalex-snapshot
Classical linear logic of implications
inferred← citeshttps://doi.org/10.1017/s0960129508007184openalex-snapshot
On traced monoidal closed categories
inferred← citeshttps://doi.org/10.1017/s096012950900766xopenalex-snapshot
From parametric polymorphism to models of polymorphic FPC
inferred← citeshttps://doi.org/10.1017/s0960129516000347openalex-snapshot
A linear/producer/consumer model of classical linear logic
inferred← citeshttps://doi.org/10.1017/s0960129521000207openalex-snapshot
Doctrines, modalities and comonads
inferred← citeshttps://doi.org/10.1017/s0960129598002722openalex-snapshot
The call-by-value λ-calculus: a semantic investigation
inferred← citeshttps://doi.org/10.1023/a:1005291931660openalex-snapshot
On an Intuitionistic Modal Logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzp057openalex-snapshot
Intuitionistic propositional logic with Galois connections
inferred← citeshttps://doi.org/10.1093/logcom/exs025openalex-snapshot
The enriched effect calculus: syntax and semantics
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00004openalex-snapshot
Resource-Aware Session Types for Digital Contracts
inferred← citeshttps://doi.org/10.1109/lics.1996.561458openalex-snapshot
Linear logic, monads and the lambda calculus
inferred← citeshttps://doi.org/10.1109/lics.1997.614954openalex-snapshot
Complete cuboidal sets in axiomatic domain theory
inferred← citeshttps://doi.org/10.1109/lics.2004.1319621openalex-snapshot
Light types for polynomial time computation in lambda-calculus
inferred← citeshttps://doi.org/10.1109/lics.2007.41openalex-snapshot
Resource modalities in game semantics
inferred← citeshttps://doi.org/10.1109/lics.2011.26openalex-snapshot
Semantics of Higher-Order Quantum Computation via Geometry of Interaction
inferred← citeshttps://doi.org/10.1109/lics.2019.8785715openalex-snapshot
Probabilistic Relational Reasoning via Metrics
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470611openalex-snapshot
Commutative Monads for Probabilistic Programming Languages
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00071openalex-snapshot
Operator Spaces, Linear Logic and the Heisenberg-Schrödinger Duality of Quantum Theory
inferred← citeshttps://doi.org/10.1145/1708016.1708027openalex-snapshot
Lightweight linear types in system f°
inferred← citeshttps://doi.org/10.1145/2034574.2034782openalex-snapshot
A semantic model for graphical user interfaces
inferred← citeshttps://doi.org/10.1145/2676726.2676969openalex-snapshot
Integrating Linear and Dependent Types
inferred← citeshttps://doi.org/10.1145/267959.269968openalex-snapshot
A reflection on call-by-value
inferred← citeshttps://doi.org/10.1145/2775051.2676969openalex-snapshot
Integrating Linear and Dependent Types
inferred← citeshttps://doi.org/10.1145/2837614.2837652openalex-snapshot
A theory of effects and resources: adjunction models and polarised calculi
inferred← citeshttps://doi.org/10.1145/3009837.3009894openalex-snapshot
QWIRE: a core language for quantum circuits
inferred← citeshttps://doi.org/10.1145/3110281openalex-snapshot
Manifest sharing with session types
inferred← citeshttps://doi.org/10.1145/3122955.3122965openalex-snapshot
The linearity Monad
inferred← citeshttps://doi.org/10.1145/3209108.3209145openalex-snapshot
Strong Sums in Focused Logic
inferred← citeshttps://doi.org/10.1145/3209108.3209189openalex-snapshot
Syntax and Semantics of Quantitative Type Theory
inferred← citeshttps://doi.org/10.1145/3209108.3209196openalex-snapshot
Enriching a Linear/Non-linear Lambda Calculus
inferred← citeshttps://doi.org/10.1145/325694.325708openalex-snapshot
Implicit parameters
inferred← citeshttps://doi.org/10.1145/340855.341002openalex-snapshot
The design, definition and implementation of programming languages
inferred← citeshttps://doi.org/10.1145/3414080.3414087openalex-snapshot
Verified Linear Session-Typed Concurrent Programming
inferred← citeshttps://doi.org/10.1145/3434331openalex-snapshot
A graded dependent type system with a usage-aware semantics
inferred← citeshttps://doi.org/10.1145/3457884openalex-snapshot
On Polymorphic Sessions and Functions
inferred← citeshttps://doi.org/10.1145/3471874.3472980openalex-snapshot
Evaluating linear functions to symmetric monoidal categories
inferred← citeshttps://doi.org/10.1145/3498662openalex-snapshot
Connectivity graphs: a method for proving deadlock freedom based on separation logic
inferred← citeshttps://doi.org/10.1145/3498687openalex-snapshot
Semantics for variational Quantum programming
inferred← citeshttps://doi.org/10.1145/3527634openalex-snapshot
CHAD: Combinatory Homomorphic Automatic Differentiation
inferred← citeshttps://doi.org/10.1145/3531130.3532445openalex-snapshot
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
inferred← citeshttps://doi.org/10.1145/3537668.3537669openalex-snapshot
Semantics column
inferred← citeshttps://doi.org/10.1145/3570919openalex-snapshot
Linear Logic Properly Displayed
inferred← citeshttps://doi.org/10.1145/3571204openalex-snapshot
Proto-Quipper with Dynamic Lifting
inferred← citeshttps://doi.org/10.1145/3609027openalex-snapshot
Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3609027.3609404openalex-snapshot
A Calculus of Inductive Linear Constructions
inferred← citeshttps://doi.org/10.1145/3609027.3609408openalex-snapshot
Combining Dependency, Grades, and Adjoint Logic
inferred← citeshttps://doi.org/10.1145/3632889openalex-snapshot
Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
inferred← citeshttps://doi.org/10.1145/3632918openalex-snapshot
Polynomial Time and Dependent Types
inferred← citeshttps://doi.org/10.1145/3636501.3636956openalex-snapshot
Displayed Monoidal Categories for the Semantics of Linear Logic
inferred← citeshttps://doi.org/10.1145/3649848openalex-snapshot
Functional Ownership through Fractional Uniqueness
inferred← citeshttps://doi.org/10.1145/3729281openalex-snapshot
Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus
inferred← citeshttps://doi.org/10.1145/3801119.3801120openalex-snapshot
A Logical Foundation for Type-Safe Cross-Language Interoperability (Keynote)
inferred← citeshttps://doi.org/10.1145/3814885.3816411openalex-snapshot
Modular Substructural Constraints for Embedded DSLs
inferred← citeshttps://doi.org/10.1184/r1/6610634openalex-snapshot
The inverse method for intuitionistic linear logic : (the propositional fragment)
inferred← citeshttps://doi.org/10.14236/ewic/fp1995.1openalex-snapshot
Uniqueness Typing in Natural Deduction Style
inferred← citeshttps://doi.org/10.17760/d20004906openalex-snapshot
Practical programming with substructural types
inferred← citeshttps://doi.org/10.20381/ruor-19805openalex-snapshot
Semantics for a higher-order functional programming language for quantum computation
inferred← citeshttps://doi.org/10.20381/ruor-20066openalex-snapshot
Categorical models of computation: Partially traced categories and presheaf models of quantum computation
inferred← citeshttps://doi.org/10.2139/ssrn.7170772openalex-snapshot
A Universal Ecumenical Proof System for Reversible and Quantum Computation
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:16)2014openalex-snapshot
Categorical Proof Theory of Co-Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:2)2012openalex-snapshot
Linear-use CPS translations in the Enriched Effect Calculus
inferred← citeshttps://doi.org/10.2197/ipsjjip.27.431openalex-snapshot
Lightweight Linearly-typed Programming with Lenses and Monads
inferred← citeshttps://doi.org/10.2197/ipsjjip.27.77openalex-snapshot
Dual-context Modal Logic as Left Adjoint of Fitch-style Modal Logic
inferred← citeshttps://doi.org/10.2307/421090openalex-snapshot
The Logic of Bunched Implications
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:30)2020openalex-snapshot
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:9)2021openalex-snapshot
LNL-FPC: The Linear/Non-linear Fixpoint Calculus
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d18openalex-snapshot
Reverse AD at Higher Types: Pure, Principled and Denotationally Correct
inferred← citeshttps://doi.org/10.3233/fun-2008-843-410openalex-snapshot
A Semantic Analysis of a Logic for Pragmatics with Assertions, Obligations, and Causal Implication
inferred← citeshttps://doi.org/10.4204/eptcs.172.10openalex-snapshot
QPEL: Quantum Program and Effect Language
inferred← citeshttps://doi.org/10.4204/eptcs.176.2openalex-snapshot
A Linear/Producer/Consumer Model of Classical Linear Logic
inferred← citeshttps://doi.org/10.4204/eptcs.238.6openalex-snapshot
Linear Exponential Comonads without Symmetry
inferred← citeshttps://doi.org/10.4204/eptcs.266.11openalex-snapshot
A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)
inferred← citeshttps://doi.org/10.4204/eptcs.291.6openalex-snapshot
A Message-Passing Interpretation of Adjoint Logic
inferred← citeshttps://doi.org/10.4204/eptcs.333.22openalex-snapshot
Computational Adequacy for Substructural Lambda Calculi
inferred← citeshttps://doi.org/10.4204/eptcs.340.9openalex-snapshot
Quantum CPOs
inferred← citeshttps://doi.org/10.4204/eptcs.357.1openalex-snapshot
A Quick Overview on the Quantum Control Approach to the Lambda Calculus
inferred← citeshttps://doi.org/10.4204/eptcs.394.16openalex-snapshot
A Biset-Enriched Categorical Model for Proto-Quipper with Dynamic Lifting
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.13openalex-snapshot
Session Types with Arithmetic Refinements
inferred← citeshttps://doi.org/10.4230/lipics.csl.2022.16openalex-snapshot
An Internal Language for Categories Enriched over Generalised Metric Spaces
inferred← citeshttps://doi.org/10.46298/entics.10507openalex-snapshot
Data Layout from a Type-Theoretic Perspective
inferred← citeshttps://doi.org/10.46298/entics.12299openalex-snapshot
A Complete V-Equational System for Graded lambda-Calculus
inferred← citeshttps://doi.org/10.46298/entics.14786openalex-snapshot
Polynomials in homotopy type theory as a Kleisli category
inferred← citeshttps://doi.org/10.46298/entics.14797openalex-snapshot
Amortized Analysis via Coalgebra
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:28)2022openalex-snapshot
Linear Dependent Type Theory for Quantum Programming Languages
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:1)2023openalex-snapshot
LNL polycategories and doctrines of linear logic
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:23)2023openalex-snapshot
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:31)2023openalex-snapshot
The syntactic side of autonomous categories enriched over generalised metric spaces
inferred← citeshttps://doi.org/10.48550/arxiv.0705.0462openalex-snapshot
Resource modalities in game semantics
inferred← citeshttps://doi.org/10.48550/arxiv.0912.0419openalex-snapshot
An affine-intuitionistic system of types and effects: confluence and termination
inferred← citeshttps://doi.org/10.48550/arxiv.1402.7041openalex-snapshot
Quantization via Linear homotopy types
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2650openalex-snapshot
Logic and linear algebra: an introduction
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5988openalex-snapshot
Linear logic with idempotent exponential modalities: a note
inferred← citeshttps://doi.org/10.48550/arxiv.1512.08009openalex-snapshot
A Framework for Dependent Types and Effects
inferred← citeshttps://doi.org/10.48550/arxiv.1605.08106openalex-snapshot
The Many Worlds of Modal λ-calculi: I. Curry-Howard for Necessity, Possibility and Time
inferred← citeshttps://doi.org/10.48550/arxiv.1612.06602openalex-snapshot
Linear Hyperdoctrines and Comodules
inferred← citeshttps://doi.org/10.48550/arxiv.1707.04984openalex-snapshot
FabULous Interoperability for ML and a Linear Language
inferred← citeshttps://doi.org/10.48550/arxiv.1806.09593openalex-snapshot
A diagram model of linear dependent type theory
inferred← citeshttps://doi.org/10.48550/arxiv.1807.00067openalex-snapshot
Josephine: Using JavaScript to safely manage the lifetimes of Rust data
inferred← citeshttps://doi.org/10.48550/arxiv.1903.02963openalex-snapshot
Duplicable von Neumann Algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1904.04371openalex-snapshot
A HoTT Quantum Equational Theory (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1904.08083openalex-snapshot
A 2-Categorical Study of Graded and Indexed Monads
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10604openalex-snapshot
Compositional theories for host-core languages
inferred← citeshttps://doi.org/10.48550/arxiv.2007.04621openalex-snapshot
Logic of computational semi-effects and categorical gluing for equivariant functors
inferred← citeshttps://doi.org/10.48550/arxiv.2010.12338openalex-snapshot
Adjoint Reactive GUI
inferred← citeshttps://doi.org/10.48550/arxiv.2011.04070openalex-snapshot
A graded dependent type system with a usage-aware semantics (extended version)
inferred← citeshttps://doi.org/10.48550/arxiv.2108.07625openalex-snapshot
Hybrid dynamical type theories for navigation
inferred← citeshttps://doi.org/10.48550/arxiv.2110.02691openalex-snapshot
Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
inferred← citeshttps://doi.org/10.48550/arxiv.math/0703713openalex-snapshot
The logic of message passing
inferred← citeshttps://doi.org/10.6083/9g54xh95nopenalex-snapshot
A categorical analysis of multi-level languages (extended abstract)
inferred← citeshttps://doi.org/10.70675/0bb75525z0078z4033z88b5z919b98f2b635openalex-snapshot
Bicategorical orthogonality constructions for linear logic
inferred← citeshttps://doi.org/10.70675/9f8726e3zcbcdz4291zabc0z21d8eaec3d98openalex-snapshot
Formal Methods for Quantum Programming Languages
inferred← citeshttps://doi.org/10.70675/9fc40dc1ze670z4d46zbadcz2e1482aaa849openalex-snapshot
Some proof-theoretical approaches to Monadic Second-Order logic
inferred← citeshttps://doi.org/10.70675/a6c55256z1f31z437czaf55z88753e210716openalex-snapshot
Théories symétriques monoïdales closes, applications au lambda-calcul et aux bigraphes
inferred← citeshttps://doi.org/10.70930/tac/4bs7somyopenalex-snapshot
Models of Linear Logic based on the Schwartz ε-product.
inferred← citeshttps://doi.org/10.70930/tac/c16x3xtfopenalex-snapshot
Category-theoretic models of Linear Abadi & Plotkin Logic
showing the first 199 of 203 · page through all 203
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.