Full Text Available
Access Full Text at Repository
Search Results - Computer Engineering
-
An intensionally fully-abstract sheaf model for $pi$ (expanded version)
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Data Complexity of Description Logic Ontologies
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Bounded degree and planar spectra
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Bottom-up automata on data trees and vertical XPath
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Boundedness in languages of infinite words
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Modular, Fully-abstract Compilation by Approximate Back-translation
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Normalisation by Evaluation for Type Theory, in Type Theory
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Games and Strategies as Event Structures
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Lax orthogonal factorisations in monad-quantale-enriched categories
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Petri Automata
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Coherent Presentations of Monoidal Categories
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
A bound for Dickson's lemma
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Improved Algorithms for Parity and Streett objectives
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Formal Languages, Formally and Coinductively
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
A new characterization of complete Heyting and co-Heyting algebras
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text