Facet browsing currently unavailable
Page 5 of 16663 results
Sort by: relevance publication year
On the existence of speed-independent circuits JOURNAL ARTICLE published September 1991 in Theoretical Computer Science |
A compositional natural semantics and Hoare logic for low-level languages JOURNAL ARTICLE published April 2007 in Theoretical Computer Science |
Automated higher-order complexity analysis JOURNAL ARTICLE published June 2004 in Theoretical Computer Science |
Pattern matching as cut elimination JOURNAL ARTICLE published September 2004 in Theoretical Computer Science |
A generalization of Owicki-Gries's Hoare logic for a concurrent while language JOURNAL ARTICLE published June 1988 in Theoretical Computer Science |
A lambda-calculus for dynamic binding JOURNAL ARTICLE published February 1998 in Theoretical Computer Science |
Verified bytecode verifiers JOURNAL ARTICLE published April 2003 in Theoretical Computer Science |
Church-Rosser theorem for a rewriting system on categorial combinators JOURNAL ARTICLE published July 1989 in Theoretical Computer Science |
Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL JOURNAL ARTICLE published July 1989 in Theoretical Computer Science |
Maximal traces and path-based coalgebraic temporal logics JOURNAL ARTICLE published September 2011 in Theoretical Computer Science |
Continuation-based transformations for coordination languages JOURNAL ARTICLE published June 2000 in Theoretical Computer Science |
On finding common subtrees JOURNAL ARTICLE published February 1993 in Theoretical Computer Science |
Typing correspondence assertions for communication protocols JOURNAL ARTICLE published May 2003 in Theoretical Computer Science |
On an interpretation of safe recursion in light affine logic JOURNAL ARTICLE published June 2004 in Theoretical Computer Science |
Concerning the semantic consequence relation in first-order temporal logic JOURNAL ARTICLE published 1986 in Theoretical Computer Science |
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials JOURNAL ARTICLE published December 1978 in Theoretical Computer Science |
On input read-modes of alternating Turing machines JOURNAL ARTICLE published August 1995 in Theoretical Computer Science |
Theoretical aspects of computing JOURNAL ARTICLE published October 2018 in Theoretical Computer Science |
Standard Sturmian words and automata minimization algorithms JOURNAL ARTICLE published October 2015 in Theoretical Computer Science Research funded by MIUR (PRIN 2010LYA9RH) |
Repetitions in Sturmian strings JOURNAL ARTICLE published October 2000 in Theoretical Computer Science |