3572 search results - page 72 / 715 » Nominal Logic Programming |
80
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
traction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK We present the first effe...
CADE
2001
Springer
16 years 26 days ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
119
click to vote
LPAR
1992
Springer
15 years 4 months ago
1992
Springer
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
FMCAD
2008
Springer
15 years 2 months ago
2008
Springer
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...
ICFP
2008
ACM
16 years 15 days 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...