|
169
|
Bisimulation Can’t Be Traced
– B Bloom, S Istrael, A Meyer
- 1995
|
|
16
|
S.: A congruence rule format for name-passing process calculi from mathematical structural operational semantics
– M Fiore, Staton
- 2006
|
|
102
|
Structural Operational Semantics
– Luca Aceto, Wan Fokkink, Chris Verhoef
- 1999
|
|
2972
|
Communication and Concurrency
– R Milner
- 1989
|
|
2
|
Proving Properties of Lists using Containers
– R Prince, N Ghani, C McBride
- 2008
|
|
6
|
for data: derivatives of data structures
– Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride
|
|
129
|
An intuitionistic theory of types: predicative part
– P Martin-Löf
- 1975
|
|
43
|
Containers - constructing strictly positive types, Theoretical Computer Science 342 (2005) 3–27, applied Semantics: Selected Topics
– M Abott, T Altenkirch, N Ghani
|
|
30
|
Categories of Containers
– Michael Abbott, Thorsten Altenkirch, Neil Ghani
- 2003
|
|
2
|
Semantics of name and value passing (extended abstract
– M P Fiore, D Turi
- 2001
|
|
33
|
A Theory of Bisimulation for the pi-calculus
– Davide Sangiorgi
- 1993
|
|
174
|
A new approach to abstract syntax with variable binding
– Murdoch J. Gabbay, Andrew M. Pitts
- 2002
|
|
933
|
Bigraphs and Mobile Processes
– Ole Høgh Jensen, Robin Milner
- 2003
|
|
20
|
S.: Comparing operational models of name-passing process calculi
– M Fiore, Staton
- 2006
|
|
279
|
Universal coalgebra: a theory of systems
– J. J. M. M. Rutten
- 2000
|
|
156
|
N.: A Final Coalgebra Theorem
– P Aczel, Mendler
- 1989
|
|
3
|
Simulations in coalgebra. Theoret
– J Hughes, B Jacobs
- 2004
|
|
22
|
Distributivity for Endofunctors, Pointed and Co-Pointed Endofunctors, Monads and Comonads
– Marina Lenisa, John Power, Hiroshi Watanabe
- 2000
|
|
122
|
Towards a Mathematical Operational Semantics
– Daniele Turi, Gordon Plotkin
- 1997
|
