Sciweavers

641 search results - page 60 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
ICFP
2003
ACM
16 years 3 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz
LCPC
2000
Springer
15 years 7 months ago
Improving Offset Assignment for Embedded Processors
Embedded systems consisting of the application program ROM, RAM, the embedded processor core, and any custom hardware on a single wafer are becoming increasingly common in applicat...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
161
Voted
TCS
1998
15 years 3 months ago
Algebraic Translations, Correctness and Algebraic Compiler Construction
Algebraic translation methods are argued for in many fields of science. Several examples will be considered: from the field of compiler construction, database updates, concurren...
Theo M. V. Janssen
ICFP
2003
ACM
16 years 3 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
177
Voted
JOT
2007
138views more  JOT 2007»
15 years 3 months ago
Flexible Language Interoperability
machines raise the abstraction level of the execution environment at the cost of restricting the set of supported languages. Moreover, the ability of a language implementation to i...
Torbjörn Ekman, Peter Mechlenborg, Ulrik Pagh...