Sciweavers

3440 search results - page 183 / 688
» Logics For Context-Free Languages
Sort
View
POPL
2012
ACM
14 years 2 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
ATAL
2005
Springer
16 years 18 days ago
Dynamic epistemic logic with assignment
We add assignment operators to languages for epistemic actions, so that change of knowledge and change of facts can be combined in specifications of multi-agent system dynamics. ...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
ICFP
2009
ACM
16 years 7 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 7 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
ECOOP
2010
Springer
15 years 10 months ago
Verifying Executable Object-Oriented Specifications with Separation Logic
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
Stephan van Staden, Cristiano Calcagno, Bertrand M...