245,200 Hits in 8.2 sec

Page 6675 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
M. (4-LEED-SC; Leeds) Supporting transformations for the partial evaluation of logic programs. (English summary) J. Logic Comput. 3 (1993), no. 5, 469-486.  ...  In order that any answer computed using a partially evaluated pro- gram could also have been computed using the original program, it is necessary that the partial evaluation satisfy certain conditions  ... 

Perspectives for proof unwinding by programming languages techniques [article]

Danko Ilik
2016 arXiv   pre-print
In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages  ...  This scientific essay, written for the audience of proof theorists as well as the working mathematician, is not a survey of the field, but rather a personal view of the author who hopes that it may inspire  ...  powerful computing abstractions that computational side-effects, partial evaluators and type isomorphisms represent.  ... 
arXiv:1605.09177v1 fatcat:w2iqiogxlrcj5fgwy35ooodlji

Page 4106 of Mathematical Reviews Vol. , Issue 94g [page]

1994 Mathematical Reviews  
V may be the full cumulative hierarchy with all functions and functionals on one end of the variety, and V may be the set of natural numbers with partial recursive functions and functionals on the other  ...  This procedure associates with each structure . of a given finite signature £ an object m™ that may be an individual, a partial function or a partial functional.  ... 

Page 5989 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
For various imperative and functional programming languages we know the complexity classes corre- sponding to the classes of spectra of partial correctness formulae.  ...  We give a correctness criterion for this partial evaluator and prove its correctness relative to this specification.  ... 

Kleene's Two Kinds of Recursion [article]

G. A. Kavvos
2018 arXiv   pre-print
Nevertheless, an old result by Rogers allows us to bridge this gap by subtly redefining the implementation of a higher-order functional in order to bring it to a 'standard form.'  ...  In some cases both theorems are applicable, but one is stronger than the other: the FRT always produces least fixed points, but this is not always the case with the SRT.  ...  Partial Evaluation. Kleene's s-m-n theorem allows one to 'specialize,' or 'partially evaluate' a certain program by fixing some of its arguments.  ... 
arXiv:1602.06220v2 fatcat:fyy2vtj43zb7xk7x7dtqdkl2mq

Probabilistic accuracy bounds for perforated programs

Martin Rinard
2011 Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation - PERM '11  
Hank Hoffman, Sasa Misailovic, Stelios Sidiroglou, and Anant Agarwal all contributed to various aspects of the loop perforation project.  ...  It is possible to generalize this approach to programs that compute arbitrary linear functions (potentially composed with nonlinear operations at the end of the computation) Profiling may help the program  ...  A New Foundation This probabilistic approach provides a new foundation for program analysis and transformation.  ... 
doi:10.1145/1929501.1929517 dblp:conf/pepm/Rinard11 fatcat:2xmthesgwrbrdnn6l7wz5ys4o4

Tutorial notes on partial evaluation

Charles Consel, Olivier Danvy
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
The last years have witnessed a flurry of new results in the area of partial evaluation. These tutorial notes survey the field and present a critical assessment of the state of the art.  ...  Introduction Partial evaluation is a source-to-source program transformation technique for specializing programs with respect to parts of their input.  ...  Code Using partial evaluation is based on a tradeoff taking more space for programs and data may produce faster computations while taking less space for programs and data may produce slower comput ations  ... 
doi:10.1145/158511.158707 dblp:conf/popl/ConselD93 fatcat:pghntu43r5bt7lya3vemy3ic7a

Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages [chapter]

Elvira Albert, Germán Vidal, Sergio Antoy
2001 Lecture Notes in Computer Science  
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages.  ...  We define several criteria for measuring the cost of a computation: number of steps, number of function applications, and pattern matching effort.  ...  We are also grateful to Mark Jones for helping us to benchmark Hugs programs.  ... 
doi:10.1007/3-540-45142-0_7 fatcat:t6y4ibyisngdzaguqrm5xc5fya

PX: A computational logic

1990 Discrete Applied Mathematics  
Approach to the Theory of Error Correcting Codes (MIT Press, Cambridge, MA, 1988) 208 pages Chapter 1: Introduction. A communication system and the effect of errors. The concept of parity.  ...  The concept of block codes. Review of the concepts introduced. Chapter 2: Linear Codes. Basic concepts. Minimum Hamming distance of a code and the error detection/correction capability of the code.  ...  PX as a logic of computation. PX as a program extractor. PX as a classical logic. PX as a foundation of type theory. The origin of PX. Overview. Chapter 2: Formal System.  ... 
doi:10.1016/0166-218x(90)90121-r fatcat:oqnkcu4qovddnfzwh4nvwc4wxy

Functional Logic Programming: From Theory to Curry [chapter]

Michael Hanus
2013 Lecture Notes in Computer Science  
This paper surveys the foundations of functional logic programming that are relevant for Curry, the main features of Curry, and extensions and applications of Curry and functional logic programming.  ...  The development of Curry is an international initiative intended to provide a common platform for the research, teaching, and application of integrated functional logic languages.  ...  Furthermore, I would like to thank Sergio Antoy, Bernd Braßel, and Germán Vidal for their constructive remarks to improve the readability of the paper.  ... 
doi:10.1007/978-3-642-37651-1_6 fatcat:bi7s3wzbvbh5xf57gsox7uhhjq

PCA: memory leak detection using partial call-path analysis

Wen Li, Haipeng Cai, Yulei Sui, David Manz
2020 Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  
Most of all, it features a partial call-path (PCA) analysis that consists of optimization options to further speed up data dependence computation.  ...  CCS CONCEPTS • Security and privacy → Software security engineering; • Theory of computationProgram analysis.  ...  One main approach to this task is to reason about program behaviors with respect to how data are computed and accessed (e.g., in terms of data dependence) in the program [5, 6] .  ... 
doi:10.1145/3368089.3417923 dblp:conf/sigsoft/LiCSM20 fatcat:tl3awh7jxrhhtbp2ro3uyfdo7u

Online Type-Directed Partial Evaluation

Olivier Danvy
1997 BRICS Report Series  
Operators may be pure or have a computational effect. <br />We report a complete implementation of online type-directed partial evaluation in Scheme, extending our earlier offline implementation.  ...  <br />Our partial evaluator is native in that it runs compiled code instead of using the usual meta-level technique of symbolic evaluation.  ...  Acknowledgements Grateful thanks to Morten Rhiger for many pleasant discussions about case-syntax, and to Julia Lawall and Karoline Malmkjaer for valuable and timely comments on an earlier version of this  ... 
doi:10.7146/brics.v4i53.19274 fatcat:f7awleju6fhpljel7cjcu7gfqy

An introduction to partial evaluation

Neil D. Jones
1996 ACM Computing Surveys  
Partial evaluation provides a unifying paradigm for a broad spectrum of work in program optimization, compiling, interpretation and the generation of automatic program generators [Bjørner et al. 1987;  ...  Much partial evaluation work to date has concerned automatic compiler generation from an interpretive definition of a programming language, but it also has important applications to scientific computing  ...  An increasing understanding is evolving of how to construct partial evaluators for various languages, of how to tame termination problems, and of the mathematical foundations of partial evaluation.  ... 
doi:10.1145/243439.243447 fatcat:zkzmmser2vh2tkjk2tqzajy3zu

The Generic Model of Computation

Nachum Dershowitz
2012 Electronic Proceedings in Theoretical Computer Science  
This approach has recently been extended to suggest a formalization of the notion of effective computation over arbitrary countable domains. The central notions are summarized herein.  ...  Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new  ...  Acknowledgements I thank Yuri Gurevich and Nikolaj Bjørner for their perspicacious suggestions, the referees for their questions, and Evgenia Falkovich for her help.  ... 
doi:10.4204/eptcs.88.5 fatcat:xiig6ywzafcehpdn6ix3wqbgci

Page 7800 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
Logic Programming 1997, Article 2, 19 pp. (electronic). Summary: “We present a minimal function graph semantics for a higher-order functional language with applicative evaluation or- der.  ...  The approach extends previous results on minimal function graphs to higher-order functions. The semantics captures the in- termediate calls performed during the evaluation of a program.  ... 
« Previous Showing results 1 — 15 out of 245,200 results