Sciweavers

27 search results - page 2 / 6
» Goto elimination in program algebra
Sort
View
LISP
2006
91views more  LISP 2006»
13 years 5 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier
BIRTHDAY
2007
Springer
13 years 11 months ago
Generating Polynomial Invariants with DISCOVERER and QEPCAD
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan
ICFP
2003
ACM
14 years 5 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
TLCA
2007
Springer
13 years 11 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani
POPL
2004
ACM
14 years 5 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier