Sciweavers

72 search results - page 11 / 15
» Semantic foundations for typed assembly languages
Sort
View
POPL
2010
ACM
14 years 6 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
14 years 1 months ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
ENTCS
2007
102views more  ENTCS 2007»
13 years 8 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
OOPSLA
2007
Springer
14 years 2 months ago
Component nextgen: a sound and expressive component framework for java
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
James Sasitorn, Robert Cartwright
AAAI
2006
13 years 10 months ago
Inconsistencies, Negations and Changes in Ontologies
Ontology management and maintenance are considered cornerstone issues in current Semantic Web applications in which semantic integration and ontological reasoning play a fundament...
Giorgos Flouris, Zhisheng Huang, Jeff Z. Pan, Dimi...