Hard life with weak binders
From MaRDI portal
Recommendations
Cites work
- A calculus of mobile processes. II
- A new approach to abstract syntax with variable binding
- A theory of contracts for web services
- Algebra of communicating processes with abstraction
- Closed reduction: explicit substitutions without $\alpha$ -conversion
- FreshML: programming with binders made simple
- Hard life with weak binders
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1231616 (Why is no real title available?)
- scientific article; zbMATH DE number 2154399 (Why is no real title available?)
- Names of the -calculus agents handled locally
- On a monadic semantics for freshness
- Operational reasoning for functions with local state
- Proof Pearl: De Bruijn Terms Really Do Work
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
- Types and Effects for Resource Usage Analysis
Cited in
(2)
This page was built for publication: Hard life with weak binders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170666)