(Definitely not) boring interaction abstract machines
From MaRDI portal
Cites work
- A call-by-name lambda-calculus machine
- Computation by interaction for space-bounded functional programming
- Deriving a lazy abstract machine
- Execution time of λ-terms via denotational semantics and intersection types
- From call-by-value to interaction by typed closure conversion
- Generalised species of rigid resource terms
- Geometry of Interaction and linear combinatory algebras
- Geometry of synthesis: a structured approach to VLSI design
- scientific article; zbMATH DE number 1722659 (Why is no real title available?)
- scientific article; zbMATH DE number 4123722 (Why is no real title available?)
- scientific article; zbMATH DE number 2016068 (Why is no real title available?)
- Linear logic
- Memoryful geometry of interaction: from coalgebraic components to algebraic effects
- On full abstraction for PCF: I, II and III
- On the relation of interaction semantics to continuations and defunctionalization
- Parallelism and synchronization in an infinitary context
- Paths, computations and labels in the \(\lambda\)-calculus
- Reversible, irreversible and optimal \(\lambda\)-machines
- Simple parsimonious types and logarithmic space
- The geometry of concurrent interaction: handling multiple ports by way of multiple tokens
- The geometry of parallelism: classical, probabilistic, and quantum effects
- The Mechanical Evaluation of Expressions
- Traced monoidal categories
This page was built for publication: (Definitely not) boring interaction abstract machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875313)
