Cs-Lo
Church => Scott = Ptime: an application of resource sensitive realizability
A Proof Theoretic Analysis of Intruder Theories
Proof nets for Herbrands Theorem
A Monadic Formalization of ML5
Equivalence Checking in Embedded Systems Design Verification using PRES+ model
An Evidential Path Logic for Multi-Relational Networks
Towards arrow-theoretic semantics of ontologies: conceptories
Classical Predicative Logic-Enriched Type Theories
Short proofs of strong normalization
A Formal Verification Methodology for Checking Data Integrity
Evolving MultiAlgebras unify all usual sequential computation models
Parikh Images of Regular Languages: Complexity and Applications
A Real World Mechanism for Testing Satisfiability in Polynomial Time
General Ramified Recurrence is Sound for Polynomial Time
Complexity of Fractran and Productivity
Beyond Language Equivalence on Visibly Pushdown Automata
Closed nominal rewriting and efficiently computable nominal algebra equality
Explicit Evidence Systems with Common Knowledge
On the relation between size-based termination and semantic labelling
Bounded Reachability for Temporal Logic over Constraint Systems
Zero Decomposition with Multiplicity of Zero-Dimensional Polynomial Systems
HMC: Verifying Functional Programs Using Abstract Interpreters
