Sciweavers

4 search results - page 1 / 1
» The unfolding of non-finitist arithmetic
Sort
View
APAL
2000
50views more  APAL 2000»
13 years 10 months ago
The unfolding of non-finitist arithmetic
Solomon Feferman, Thomas Strahm
ICFP
1998
ACM
14 years 3 months ago
Fold and Unfold for Program Semantics
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
Graham Hutton
COMPGEOM
2004
ACM
14 years 4 months ago
An energy-driven approach to linkage unfolding
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
Jason H. Cantarella, Erik D. Demaine, Hayley N. Ib...
SYNASC
2005
IEEE
117views Algorithms» more  SYNASC 2005»
14 years 4 months ago
Functional-Based Synthesis of Systolic Online Multipliers
— Systolic online algorithms for the multiplication of univariate polynomials and of multiple precision integers are synthesised using a novel method based on the following funct...
Tudor Jebelean, Laura Szakacs