52 search results - page 8 / 11 » Some Grammatical Structures of Programming Languages as Simp... |
MPC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
PEPM
2011
ACM
12 years 10 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-leve...