10871 search results - page 324 / 2175 » A stable programming language |
143
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
182
click to vote
PLDI
2005
ACM
16 years 7 days ago
2005
ACM
This paper introduces the concept of programming with sketches, an approach for the rapid development of high-performance applications. This approach allows a programmer to write ...
194
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
194
click to vote
NMR
2004
Springer
16 years 20 hour ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
164
Voted
LPNMR
1999
Springer
15 years 11 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...