LINEARITY/TLLA PRE-PROCEEDINGS: KEYWORD INDEX

A | |

adjoint logic | |

adjoint model | |

affine term | |

Algebraic Geometry | |

ATP | |

automated trading systems | |

B | |

benchmark | |

C | |

call-by-name | |

call-by-push value | |

call-by-value | |

Categorical models | |

Categorical semantics | |

CLF | |

coends | |

cographs | |

combinatoric | |

combinatorics | |

Complexity Theory | |

correctness criteria | |

CPS translation | |

cyclic lambda calculus | |

cyclic sharing | |

D | |

denotational model | |

denotational semantics | |

dependent types | |

dialectica category | |

Differential Linear Logic | |

Dynamical Systems | |

E | |

elementary linear logic | |

exchange | |

F | |

Freyd categories | |

Functional Analysis | |

G | |

geometry of interaction | |

Girard's translations | |

H | |

hypersequents | |

I | |

implicit complexity | |

interaction graphs | |

Intersection Type Systems | |

L | |

lambda calculus | |

lambda-calculus | |

Lambek calculus | |

linear logic | |

linear term | |

linear/non-linear logic | |

logical framework | |

M | |

modalities | |

Monad | |

monoidal categories | |

multiplicative linear logic | |

N | |

non-commutative | |

O | |

Operad | |

operational semantics | |

P | |

process calculus | |

Proof nets | |

Q | |

Quantum functional languages | |

Quantum Programming | |

R | |

regular languages | |

S | |

second order quantifiers | |

second-order quantification | |

semantics | |

sequent calculus | |

Species of Structures | |

star-autonomous categories | |

substructural calculus | |

T | |

Taylor expansion | |

traced monoidal categories | |

transcendental syntax | |

translations | |

type theory | |

Y | |

Yoneda isomorphism |