| | |
Summary: The Pull-Tab Transformation
Abdulla Alqaddoumi1
Sergio Antoy2
Sebastian Fischer3
Fabian Reck3
1
Department of Computer Science
New Mexico State University
Las Cruces, NM 88003, U.S.A.
2
Computer Science Department
Portland State University
Portland, OR 97207, U.S.A.
3
Institut f¨ur Informatik
Christian-Albrechts-Universit¨at Kiel
D-24098 Kiel, Germany
Abstract. We present a new approach to the execution of functional
logic programs. Our approach relies on definitional trees for the deter-
ministic portions of a computation and on a graph transformation, called
|
