Filters








34,351 Hits in 2.5 sec

Primitive recursive program transformation

R. S. Boyer, J. S. Moore, R. E. Shostak
1976 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76  
We describe how to transform certain flowchart programs into equivalent explicit primitive recursive proerams.  ...  In particular, the transformed correctness conditions can often be verified automatically by the theorem prover developed by Boyer and Moore [I].  ...  TRANSFORMATION TO PRIMITIVE RECURSION The solution we propose here is to transform the nonprimitive recursive definition of intl into one that is primitive recursive.  ... 
doi:10.1145/800168.811550 dblp:conf/popl/BoyerMS76 fatcat:27cgkyc73vfptdwp5hqkthhxyu

Genetic programming with primitive recursion

Stefan Kahrs
2006 Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06  
It is possible to extend the expressiveness of such an approach significantly without leaving the comfort of terminating programs by including primitive recursion as a control operation.  ...  When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters or certain primitive  ...  Singling out certain primitive recursive functions (addition, multiplication) as additional primitives transformed the search space, but these transformations turned out to be counter-productive.  ... 
doi:10.1145/1143997.1144160 dblp:conf/gecco/Kahrs06 fatcat:rqcajdwsijcddpsvpwzuwh36du

A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration

Luca; Universita' Degli Studi Di Parma Chiarabini, Danvy, Olivier; Aarhus University
2011 Journal of Formalized Reasoning  
As a result, we can directly extract a variety of recursive and iterative functional programs of the kind usually written or optimized by hand.  ...  We use 'Kleene's trick' to show that primitive recursion and primitive iiteration are as expressive as the other, even in the presence of accumulators.  ...  program other program We focus on primitive recursion,à la Gödel, and primitive iteration,à la Church.  ... 
doi:10.6092/issn.1972-5787/2225 dblp:journals/jfrea/ChiarabiniD11 fatcat:tno67safvjfkhnehcoh4cmllca

Automatic time-bound analysis for a higher-order language

Gustavo Gómez, Yanhong A. Liu
2002 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation - PEPM '02  
They call it a language-based approach since it primarily exploits methods and techniques for static program analysis and transformation.  ...  We describe analysis and transformation algorithms and explain how they work. We have implemented this approach and performed a large number of experiments analyzing Scheme programs.  ...  Rule vb 2 transforms arguments of a constructor recursively.  ... 
doi:10.1145/503032.503039 dblp:conf/pepm/GomezL02 fatcat:w2rwyd5zqrfejfychqispze55a

Automatic time-bound analysis for a higher-order language

Gustavo Gómez, Yanhong A. Liu
2002 SIGPLAN notices  
They call it a language-based approach since it primarily exploits methods and techniques for static program analysis and transformation.  ...  We describe analysis and transformation algorithms and explain how they work. We have implemented this approach and performed a large number of experiments analyzing Scheme programs.  ...  Rule vb 2 transforms arguments of a constructor recursively.  ... 
doi:10.1145/509799.503039 fatcat:sz64qrzaifbcna5o4wx6xpssey

Automatic accurate time-bound analysis for high-level languages [chapter]

Yanhong A. Liu, Gustavo Gomez
1998 Lecture Notes in Computer Science  
optimizations to make t h e o verall analysis e cient a s w ell as accurate, and measurements of primitive parameters, all at the source-language level.  ...  We have implemented this approach and performed a number of experiments for analyzing Scheme programs. The measured worst-case times are closely bounded by the calculated bounds.  ...  The algorithm, given below, is presented as a transformation T on the original program, which calls a transformation T e to recursively transform subexpressions.For example, a v ariable reference is transformed  ... 
doi:10.1007/bfb0057778 fatcat:bkua2vycozgy7k3plktvtspsba

A transformation system combining partial evaluation with term rewriting [chapter]

Françoise Bellegarde
1994 Lecture Notes in Computer Science  
This paper presents a new approach to optimizing functional programs based on combining partial evaluation and rewriting. Programs are composed of higher-order primitives.  ...  Laws about the higher-order primitives that are relevant for the optimizations are automatically extracted from a library and transformed into rst-order terms using partial evaluation.  ...  These transformations are applicable to functional programs that describe rst-order functions using constant or variable-only higher-order primitives.  ... 
doi:10.1007/3-540-58233-9_3 fatcat:xdwt37nrjvc4pp7texpc4dlykm

Left termination turned into termination

Kees Doets
1994 Theoretical Computer Science  
Subsequently this is used to obtain terminating programs computing total recursive functions.  ...  ., Left termination turned into termination, Theoretical Computer Science 124 (1994) 181-188 A transformation of programs is given that turns left terminating behaviour into terminating behaviour.  ...  By the above, the "natural" program rules computing a primitive recursion are left terminating on the class AGG.  ... 
doi:10.1016/0304-3975(94)90059-0 fatcat:5fhxofibizgkpdqweqpth4iuqi

Alternative programming interfaces for alternative programmers

Toby Schachman
2012 Proceedings of the ACM international symposium on New ideas, new paradigms, and reflections on programming and software - Onward! '12  
Additionally, the design of the interface focuses on program transformation, rather than program construction.  ...  Instead of a compiler or interpreter, Recursive Drawing's programming interface is modeled as a constraint solver.  ...  Acknowledgments Thanks to my test users, whose discoveries and frustrations pointed the way in the development of Recursive Drawing.  ... 
doi:10.1145/2384592.2384594 dblp:conf/oopsla/Schachman12 fatcat:zvfh56fhsnafzn76q7mve47zz4

Imperative functional programming

U. S. Reddy
1996 ACM Computing Surveys  
This recursive dependence of functions on other functions bottoms out with the primitive operators.  ...  It is often felt that imperative computations and functional programming are in conflict.  ...  This recursive dependence of functions on other functions bottoms out with the primitive operators.  ... 
doi:10.1145/234528.234736 fatcat:obrufxbfj5eqbkptrah7arerhe

POSTER

Rezaul Chowdhury, Pramod Ganapathi, Yuan Tang, Jesmin Jahan Tithi
2017 SIGPLAN notices  
In this work, we show how to systematically transform standard cache-oblivious recursive divide-and-conquer algorithms into recursive wavefront algorithms to achieve optimal parallel cache complexity and  ...  primitives do not apply.  ...  But current theory of scheduling nested parallel programs with fork-join primitives do not allow such atomic operations.  ... 
doi:10.1145/3155284.3019031 fatcat:cnvgigdefnde5cbkjr6dwguxii

A Statically Allocated Parallel Functional Language [chapter]

Alan Mycroft, Richard Sharp
2000 Lecture Notes in Computer Science  
The space of functions expressible in SAFL is incomparable with the space of primitive recursive functions, in particular interpreters are expressible.  ...  SAFL programs have a well defined notion of total (program and data) size which we refer to as 'area'; similarly we can talk about execution 'time'.  ...  primitive recursive form.  ... 
doi:10.1007/3-540-45022-x_5 fatcat:t4q5dpulzjcyznnrmyjv2dwueq

The Building Block Basis for Genetic Programming and Variable-length Genetic Algorithms

Riccardo Poli, Christopher R. Stephens
2005 International Journal of Computational Intelligence Research  
In this paper we show that there is a natural generalisation of the BBB for variable-length strings and program trees.  ...  from the transformation matrices that transform single bits or primitives of a given arity.  ...  The space Ω t d of program trees that can be constructed using the primitives in P, and are of depth up to d, is built using the following recursion: 4 Ω t 0 = P 0 Ω t d = amax a=0 P a ⊗ (Ω t d−1 ) ⊗a  ... 
doi:10.5019/j.ijcir.2005.34 fatcat:bd442gwua5gbrosdn2bagx7h3m

A functional representation of data structures with a hole

Yasuhiko Minamide
1998 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98  
functions such as append and map as tail recursive functions.  ...  In this paper we present an approach to introducing data structures with a hole into call-by-value functional programming languages like ML.  ...  This lemma implies that the transformation preserves the type of a program.  ... 
doi:10.1145/268946.268953 dblp:conf/popl/Minamide98 fatcat:kwqmijr6zzd4pecip46seo4eam

Fixing idioms

Dominique Devriese, Ilya Sergey, Dave Clarke, Frank Piessens
2013 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation - PEPM '13  
We propose a recursion primitive afix that models a recursive binder in a finally tagless HOAS encoding, but with a novel rank-2 type that allows us to specify and exploit the effectsvalues separation  ...  We show how higher-order recursive operators like many can be encoded without special library support, unlike previous approaches, and we demonstrate an implementation of the left recursion removal transform  ...  Using generic programming techniques, we implement a mutual recursion primitive that reduces mutually recursive bindings to a series of recursive bindings.  ... 
doi:10.1145/2426890.2426910 dblp:conf/pepm/DevrieseSCP13 fatcat:4mjxt5sn2vazzjgb27wjboecfi
« Previous Showing results 1 — 15 out of 34,351 results