Sciweavers

686 search results - page 38 / 138
» Foundations for Bidirectional Programming
Sort
View
ISORC
2003
IEEE
15 years 2 months ago
Basic Program Structures for Avoiding Priority Inversions
: Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modern real-time distr...
K. H. Kim
ENTCS
2007
102views more  ENTCS 2007»
14 years 9 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
CADE
2001
Springer
15 years 10 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
75
Voted
CATS
2008
14 years 11 months ago
The Core Concept for 0/1 Integer Programming
In this paper we examine an extension of the core concept for the 0/1 Multidimensional Knapsack Problem (MKP) towards general 0/1 Integer Programming (IP) by allowing negative pro...
Samuel Huston, Jakob Puchinger, Peter J. Stuckey
118
Voted
ICFP
1999
ACM
15 years 2 months ago
Interlanguage Working Without Tears: Blending SML with Java
A good foreign-language interface is crucial for the success of any modern programming language implementation. Although all serious compilers for functional languages have some f...
Nick Benton, Andrew Kennedy