Sciweavers

513 search results - page 13 / 103
» Test Construction for Mathematical Functions
Sort
View
POPL
2010
ACM
14 years 5 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
ENTCS
2010
102views more  ENTCS 2010»
13 years 2 months ago
Test Case Generation for Adequacy of Floating-point to Fixed-point Conversion
Porting an application written for personal computer to embedded devices requires conversion of floating-point numbers and operations into fixed-point ones. Testing the conversion...
Tuan-Hung Pham, Anh-Hoang Truong, Wei-Ngan Chin, T...
ENTCS
2007
102views more  ENTCS 2007»
13 years 7 months ago
Encoding Functional Relations in Scunak
We describe how a set-theoretic foundation for mathematics can be encoded in the new system Scunak. We then discuss an encoding of the construction of functions as functional relat...
Chad E. Brown
ISSAC
2005
Springer
77views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Picard--Vessiot extensions for linear functional systems
Picard-Vessiot extensions for ordinary differential and difference equations are well known and are at the core of the associated Galois theories. In this paper, we construct fu...
Manuel Bronstein, Ziming Li, Min Wu
ENTCS
2008
116views more  ENTCS 2008»
13 years 7 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...