Results: 9
ORDER-INVARIANT TYPES AND THEIR APPLICATIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:9)2016
- By:
- Publication type:
- Article
SIMULATION PROBLEMS OVER ONE-COUNTER NETS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:6)2016
- By:
- Publication type:
- Article
(LEFTMOST-OUTERMOST) BETA REDUCTION IS INVARIANT, INDEED.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:4)2016
- By:
- Publication type:
- Article
TYPE-CHECKING LIVENESS FOR COLLABORATIVE PROCESSES WITH BOUNDED AND UNBOUNDED RECURSION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:1)2016
- By:
- Publication type:
- Article
A SORTED SEMANTIC FRAMEWORK FOR APPLIED PROCESS CALCULI.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:8)2016
- By:
- Publication type:
- Article
PROOF EQUIVALENCE IN MLL IS PSPACE-COMPLETE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:2)2016
- By:
- Publication type:
- Article
WEAK TOPOLOGIES FOR LINEAR LOGIC.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:3)2016
- By:
- Publication type:
- Article
SEPARATING REGULAR LANGUAGES WITH FIRST-ORDER LOGIC.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:5)2016
- By:
- Publication type:
- Article
HISTORY-REGISTER AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2016, v. 12, n. 1, p. 1, doi. 10.2168/LMCS-12(1:7)2016
- By:
- Publication type:
- Article