643 search results - page 81 / 129 » Semantic Determinism and Functional Logic Program Properties |
128
Voted
ATVA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
130
Voted
OOPSLA
2009
Springer
15 years 10 months ago
2009
Springer
Programs written in managed languages are compiled to a platform-independent intermediate representation, such as Java bytecode. The relative high level of Java bytecode has engen...
146
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
147
Voted
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
120
Voted
ICFP
2002
ACM
16 years 3 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...