Full Text Available
Access Full Text at Repository
Search Results - Information Engineering
-
Decidability of higher-order matching
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
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
-
Polygraphic programs and polynomial-time functions
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Universal Structures and the logic of Forbidden Patterns
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Simulating reachability using first-order logic with applications to verification of linked data structures
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Polynomial Size Analysis of First-Order Shapely Functions
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Solving Simple Stochastic Games with Few Random Vertices
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Ranking Functions for Size-Change Termination II
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Qualitative Logics and Equivalences for Probabilistic Systems
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Church Problem for Countable Ordinals
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Omega Rule is $mathbf{Pi_{1}^{1}}$-Complete in the $lambdabeta$-Calculus
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Footprints in Local Reasoning
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Neighbourhood Structures: Bisimilarity and Basic Model Theory
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
On tiered small jump operators
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Cut-Simulation and Impredicativity
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text