Sciweavers

4372 search results - page 621 / 875
» Algorithmic Theories of Everything
Sort
View
POPL
2004
ACM
16 years 7 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
POPL
2004
ACM
16 years 7 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 6 months ago
Inverting schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin
ICFP
2007
ACM
16 years 6 months ago
A type system for recursive modules
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
Derek Dreyer
ICFP
2001
ACM
16 years 6 months ago
Recursive Structures for Standard ML
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
Claudio V. Russo