scientific article; zbMATH DE number 236855

zbMath0875.68290MaRDI QIDQ5287559

Peter Sestoft, Carsten K. Gomard, Neil D. Jones

Publication date: 15 July 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68N99)

Related Items (only showing first 100 items - show all)

Self-quotation in a typed, intensional lambda-calculus ⋮ A regeneration scheme for generating extensions ⋮ Condition/decision duality and the internal logic of extensive restriction categories ⋮ Rules + strategies for transforming lazy functional logic programs ⋮ Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant ⋮ Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) ⋮ Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics ⋮ On obtaining the Boyer-Moore string-matching algorithm by partial evaluation ⋮ Ensuring the quasi-termination of needed narrowing computations ⋮ Generalization strategies for the verification of infinite state systems ⋮ Maximally-Polyvariant Partial Evaluation in Polynomial Time ⋮ Open Call-by-Value ⋮ Termination of floating-point computations ⋮ An Action Semantics Based on Two Combinators ⋮ Code analysis for temporal predictability ⋮ Parallel dynamic semantics of sequential programs with speculative and incremental computation ⋮ An iterative approach to precondition inference using constrained Horn clauses ⋮ Schlegel Diagram and Optimizable Immediate Snapshot Protocol ⋮ Lambda calculus with explicit recursion ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ Horn Clause Solvers for Program Verification ⋮ Computing in unpredictable environments: semantics, reduction strategies, and program transformations ⋮ Self-generating program specializers ⋮ New architectures for constructed complex systems ⋮ Inter-deriving Semantic Artifacts for Object-Oriented Programming ⋮ Closed-form upper bounds in static cost analysis ⋮ Reversible computing from a programming language perspective ⋮ Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis ⋮ Fast offline partial evaluation of logic programs ⋮ Unnamed Item ⋮ Reverse universal resolving algorithm and inverse driving ⋮ REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION ⋮ Unnamed Item ⋮ Program verification: state of the art, problems, and results. I ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Model-checking process equivalences ⋮ A survey of strategies in rule-based program transformation systems ⋮ Intensional computation with higher-order functions ⋮ A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs ⋮ Proving the correctness of recursion-based automatic program transformations ⋮ Programs as data structures in \(\lambda\)SF-calculus ⋮ Programming in Biomolecular Computation ⋮ Tree dimension in verification of constrained Horn clauses ⋮ Maximal incompleteness as obfuscation potency ⋮ Partial evaluation of string obfuscations for Java malware detection ⋮ INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS ⋮ A Case Study in Abstract Interpretation Based Program Transformation ⋮ Oracle-Based Partial Evaluation ⋮ On one application of computations with oracle ⋮ Partial evaluation of Maple ⋮ Chemical foundations of distributed aspects ⋮ Syntactic Type Soundness for the Region Calculus ⋮ Termination of narrowing via termination of rewriting ⋮ Efficient instance retrieval with standard and relational path indexing ⋮ Impact of Accuracy Optimization on the Convergence of Numerical Iterative Methods ⋮ Unnamed Item ⋮ Type Specialization in Aldor ⋮ A calculus for reasoning about software composition ⋮ Efficient and flexible access control via Jones-optimal logic program specialisation ⋮ Imperative-program transformation by instrumented-interpreter specialization ⋮ Unnamed Item ⋮ Type-based homeomorphic embedding for online termination ⋮ On reductants in the framework of multi-adjoint logic programming ⋮ Interleaving Symbolic Execution and Partial Evaluation ⋮ Automatically Splitting a Two-Stage Lambda Calculus ⋮ A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs ⋮ Fast Offline Partial Evaluation of Large Logic Programs ⋮ Termination of Narrowing in Left-Linear Constructor Systems ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ The applicability of logic program analysis and transformation to theorem proving ⋮ Proving the correctness of recursion-based automatic program transformations ⋮ Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs ⋮ The development of a partial evaluator for extended lambda calculus ⋮ A Practical Simulation Result for Two-Way Pushdown Automata ⋮ An investigation of Jones optimality and BTI-universal specializers ⋮ Constructive linear-time temporal logic: proof systems and Kripke semantics ⋮ Encoding types in ML-like languages ⋮ An improved reductant calculus using fuzzy partial evaluation techniques ⋮ Fusing Logic and Control with Local Transformations ⋮ Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity ⋮ Extending a partial evaluator which supports separate compilation ⋮ DyC: An expressive annotation-directed dynamic compiler for C ⋮ Accurate program analyses for successful specialization of legacy system software ⋮ MetaML and multi-stage programming with explicit annotations ⋮ Lambda-dropping: Transforming recursive equations into programs with block structure ⋮ Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation ⋮ Preserving Sharing in the Partial Evaluation of Lazy Functional Programs ⋮ A residualizing semantics for the partial evaluation of functional logic programs. ⋮ Proof-directed program transformation: A functional account of efficient regular expression matching ⋮ Constraint-based partial evaluation for imperative languages ⋮ Efficient Reductants Calculi using Partial Evaluation Techniques with Thresholding ⋮ Composition is almost (but not quite) as good as \(s-1-1\) ⋮ Narrowing and Rewriting Logic: from Foundations to Applications ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism ⋮ An NSF proposal ⋮ Termination analysis for offline partial evaluation of a higher order functional language ⋮ Computing in unpredictable environments: Semantics, reduction strategies, and program transformations

This page was built for publication: