Full Text Available
Access Full Text at Repository
Search Results - Information Science
-
A Graph Model for Imperative Computation
Published in Logical Methods in Computer Science (2010)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computation Tree Logic with Deadlock Detection
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Infinite Computations In Models of Set Theory
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Infinitary Combinatory Reduction Systems: Confluence
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Step-indexed Semantics of Imperative Objects
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Type System For Call-By-Name Exceptions
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A rich hierarchy of functionals of finite types
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Applications of Metric Coinduction
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Representations of Stream Processors Using Nested Fixed Points
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Full abstraction for nominal general references
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Relational Parametricity for Computational Effects
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
RPO, Second-order Contexts, and Lambda-calculus
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Two-Way Unary Temporal Logic over Trees
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Lindstrom theorems for fragments of first-order logic
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Decidability of higher-order matching
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Theory of Explicit Substitutions with Safe and Full Composition
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Formalising the pi-calculus using nominal logic
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Explicit fairness in testing semantics
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text