203 search results - page 1 / 41 » A Linear Metalanguage for Concurrency |
AMAST
1998
Springer
13 years 9 months ago
1998
Springer
LICS
1994
IEEE
13 years 9 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
CONCURRENCY
2010
13 years 5 months ago
2010
CONCURRENCY
2008
13 years 5 months ago
2008
CSL
2009
Springer
13 years 11 months ago
2009
Springer
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...