Sciweavers

130 search results - page 23 / 26
» An Equational Calculus for Alloy
Sort
View
CALCO
2009
Springer
162views Mathematics» more  CALCO 2009»
16 years 1 months ago
Semantics of Higher-Order Recursion Schemes
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
Jirí Adámek, Stefan Milius, Jiri Vel...
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
16 years 22 days ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
CSL
2004
Springer
16 years 6 min ago
Axioms for Delimited Continuations in the CPS Hierarchy
A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard call-by-value CPS translation, Danvy ...
Yukiyoshi Kameyama
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 12 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
TACS
1991
Springer
15 years 10 months ago
An Extension of System F with Subtyping
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
Luca Cardelli, Simone Martini, John C. Mitchell, A...