Sciweavers

1185 search results - page 121 / 237
» Implementing Functional Languages: a tutorial
Sort
View
133
Voted
ICFP
2008
ACM
16 years 2 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
PRDC
2005
IEEE
15 years 8 months ago
Development of Dependable Real-Time Systems with Zerberus
Although the main fault-tolerance techniques are known for a long time, there exists no consistent approach for implementing dependable applications in the sense that the fault-to...
Christian Buckl, Alois Knoll, Gerhard Schrott
CADE
1990
Springer
15 years 6 months ago
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
Robert S. Boyer, J. Strother Moore
100
Voted
AISC
2006
Springer
15 years 6 months ago
Operator Calculus Approach to Solving Analytic Systems
Solving analytic systems using inversion can be implemented in a variety of ways. One method is to use Lagrange inversion and variations. Here we present a different approach, base...
Philip Feinsilver, René Schott
136
Voted
PEPM
2011
ACM
14 years 5 months ago
Ordering multiple continuations on the stack
Passing multiple continuation arguments to a function in CPS form allows one to encode a wide variety of direct-style control constructs, such as conditionals, exceptions, and mul...
Dimitrios Vardoulakis, Olin Shivers