88 search results - page 4 / 18 » Proving the Correctness of the STG Machine |
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
TNN
2010
13 years 2 months ago
2010
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
ASM
2004
ASM
14 years 1 months ago
2004
ASM
tographic Abstract Machine Dean Rosenzweig and Davor Runje University of Zagreb The Cryptographic Abstract Machine is an executional model of cryptographic actions, independent of ...
LFCS
1992
Springer
13 years 11 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
FAC
2010
13 years 6 months ago
2010
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...