1174 search results - page 180 / 235 » A Logical Approach to Abstract Algebra |
ICFP
2010
ACM
13 years 11 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
PPDP
2005
Springer
14 years 3 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
ICFP
2002
ACM
14 years 10 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
RULEML
2005
Springer
14 years 3 months ago
2005
Springer
an Abstract Syntax and Direct-Model Theoretic Semantics for RuleML . 45 Adrian Giurca and Gerd Wagner A Semantic Web Framework for Interleaving Policy Reasoning and External Servic...
ESOP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...