2362 search results - page 151 / 473 » Programming in Standard ML |
142
click to vote
APLAS
2007
ACM
15 years 8 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
123
click to vote
FLOPS
2004
Springer
15 years 9 months ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
113
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
125
click to vote
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
145
Voted
ORL
2008
15 years 3 months ago
2008
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...