On the public citation graph
Proving and applying program transformations expressed with second-order patterns
0 signed · 275 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-6315-9_15openalex-snapshot
A System which Automatically Improves Programs
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1007/bf01951942openalex-snapshot
Optimal measurement points for program frequency counts
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/s0022-0000(71)80036-3openalex-snapshot
Translating recursion equations into flow charts
inferredcites →https://doi.org/10.1016/s0022-0000(73)80032-7openalex-snapshot
Characterizations of flowchartable recursions
inferredcites →https://doi.org/10.1093/comjnl/9.1.45openalex-snapshot
The Equivalence of Certain Computations
inferredcites →https://doi.org/10.1109/sfcs.1977.9openalex-snapshot
Conflunt reductions: Abstract properties and applications to term rewriting systems
inferredcites →https://doi.org/10.1109/swat.1973.7openalex-snapshot
Efficient compilation of linear recursive programs
inferredcites →https://doi.org/10.1109/tse.1976.233533openalex-snapshot
Goal-Directed Program Transformation
inferredcites →https://doi.org/10.1145/321864.321875openalex-snapshot
Proving Theorems about LISP Functions
inferredcites →https://doi.org/10.1145/321992.322000openalex-snapshot
Program Improvement by Source-to-Source Transformation
inferredcites →https://doi.org/10.1145/355609.362336openalex-snapshot
Inductive methods for proving properties of programs
inferredcites →https://doi.org/10.1145/360303.360308openalex-snapshot
The denotational semantics of programming languages
inferredcites →https://doi.org/10.1145/367177.367199openalex-snapshot
Recursive functions of symbolic expressions and their computation by machine, Part I
inferredcites →https://doi.org/10.1145/512950.512972openalex-snapshot
Threshold evaluation and the semantics of call by value, assignment and generic procedures
inferredcites →https://doi.org/10.1145/512976.512983openalex-snapshot
Correctness-preserving program transformations
inferredcites →https://doi.org/10.1145/800191.805652openalex-snapshot
Improving and refining programs by program manipulation
inferredcites →https://doi.org/10.1145/800235.807067openalex-snapshot
Implementation and applications of Scott's logic for computable functions
inferredcites →https://doi.org/10.7551/mitpress/12274.003.0023openalex-snapshot
Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.10273openalex-snapshot
Efficient schema matching algorithm based on pre‐checking
inferred← citeshttps://doi.org/10.1002/scj.4690200110openalex-snapshot
Transformation rules for automated design of circuits by theorem‐proving techniques. Transformation from recursion equations to circuit descriptions
inferred← citeshttps://doi.org/10.1002/scj.4690210610openalex-snapshot
Automated Design of Circuits from Recursion Equations Using Theorem‐Proving Technique
inferred← citeshttps://doi.org/10.1006/inco.2000.2877openalex-snapshot
On the Undecidability of Second-Order Unification
inferred← citeshttps://doi.org/10.1006/jsco.1999.0346openalex-snapshot
Program Development Schemata as Derived Rules
inferred← citeshttps://doi.org/10.1006/jsco.1999.0348openalex-snapshot
An Abstract Formalization of Correct Schemas for Program Synthesis
inferred← citeshttps://doi.org/10.1007/10705424_14openalex-snapshot
Higher Order Matching for Program Transformation
inferred← citeshttps://doi.org/10.1007/10720076_21openalex-snapshot
Automatic Extraction of Logic Program Transformations from Examples
inferred← citeshttps://doi.org/10.1007/10720076_8openalex-snapshot
A Practical Approach for Logic Program Analysis and Transformation
inferred← citeshttps://doi.org/10.1007/11805618_20openalex-snapshot
RAPT: A Program Transformation System Based on Term Rewriting
inferred← citeshttps://doi.org/10.1007/11814771_3openalex-snapshot
Representing and Reasoning with Operational Semantics
inferred← citeshttps://doi.org/10.1007/11916277_5openalex-snapshot
Matching Modulo Superdevelopments Application to Second-Order Matching
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_22openalex-snapshot
Suggestions for composing and specifying program design decisions
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_6openalex-snapshot
A system for proving equivalences of recursive programs
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_32openalex-snapshot
An axiomatic approach to the Korenjak - Hopcroft algorithms
inferred← citeshttps://doi.org/10.1007/3-540-16492-8_94openalex-snapshot
Higher-order logic programming
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_12openalex-snapshot
A functional language for the specification of complex tree transformations
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_4openalex-snapshot
Using Theory Morphisms for Implementing Formal Methods Tools
inferred← citeshttps://doi.org/10.1007/3-540-39953-4_12openalex-snapshot
Software Development in PVS Using Generic Development Steps
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_9openalex-snapshot
Cooperation of Formal Methods in an Engineering Based Software Development Process
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_1openalex-snapshot
The Metalanguage λprolog and Its Implementation
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_16openalex-snapshot
Abstract Syntax for Variable Binders: An Overview
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_6openalex-snapshot
Logic Program Synthesis in a Higher-Order Setting
inferred← citeshttps://doi.org/10.1007/3-540-44978-7_13openalex-snapshot
Higher-Order Pattern Matching for Automatically Applying Fusion Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_19openalex-snapshot
Sequent Schema for Derived Rules
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_2openalex-snapshot
Higher Order Unification 30 Years Later
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_20openalex-snapshot
Type Inference for First-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_6openalex-snapshot
Complexity of the Higher Order Matching
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_43openalex-snapshot
Tractable and Intractable Second-Order Matching Problems
inferred← citeshttps://doi.org/10.1007/3-540-49674-2_4openalex-snapshot
Logic Program Schemas, Constraints, and Semi-unification
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_104openalex-snapshot
Higher-order unification with dependent function types
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_38openalex-snapshot
Aformal approach to some usually informal techniques used in mathematical reasoning
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_13openalex-snapshot
Deriving mixed evaluation from standard evaluation for a simple functional language
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_41openalex-snapshot
More efficient bottom-up tree pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_116openalex-snapshot
Programming by example and proving by example using higher-order unification
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_92openalex-snapshot
Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_9openalex-snapshot
Tree transformations, functional languages, and attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-53162-9_45openalex-snapshot
A matching process modulo a theory of categorical products
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_83openalex-snapshot
Rewriting, and equational unification: the higher-order cases
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_113openalex-snapshot
Second-order unification in the presence of linear shallow algebraic equations
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_58openalex-snapshot
A second-order pattern matching algorithm for the cube of typed λ-calculi
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_56openalex-snapshot
From programming-by-example to proving-by-example
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_24openalex-snapshot
Abstract syntax and logic programming
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_156openalex-snapshot
Reduction and unification in Lambda calculi with subtypes
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_174openalex-snapshot
Using middle-out reasoning to control the synthesis of tail-recursive programs
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_193openalex-snapshot
Some termination criteria for narrowing and E-narrowing
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_145openalex-snapshot
A bottom-up interpreter for a higher-order logic programming language
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_14openalex-snapshot
A compositional approach for fault-tolerance using specification transformation
inferred← citeshttps://doi.org/10.1007/3-540-57287-2_51openalex-snapshot
Second order E-matching as a tool for automated theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-57499-9_23openalex-snapshot
Rules and strategies for program transformation
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_42openalex-snapshot
Representing proof transformations for program optimization
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_9openalex-snapshot
Compilation of Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_66openalex-snapshot
A restricted form of higher-order rewriting applied to an HDL semantics
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_54openalex-snapshot
Higher-order narrowing with convergent systems
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_69openalex-snapshot
Representing, verifying and applying software development steps using the PVS system
inferred← citeshttps://doi.org/10.1007/3-540-60385-9_3openalex-snapshot
Describing and verifying synchronous circuits with the Boyer-Moore theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_52openalex-snapshot
Deriving and applying logic program transformers
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_52openalex-snapshot
Generic system support for deductive program development
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_36openalex-snapshot
Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
inferred← citeshttps://doi.org/10.1007/3-540-61254-8_22openalex-snapshot
The variable containment problem
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_47openalex-snapshot
Higher-order superposition for dependent types
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_62openalex-snapshot
Efficient second-order matching
inferred← citeshttps://doi.org/10.1007/3-540-61859-7_20openalex-snapshot
Automatic bottom-up analysis and transformation of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_53openalex-snapshot
Proof discovery in LK system by analogy
inferred← citeshttps://doi.org/10.1007/3540634932_5openalex-snapshot
Many-sorted logic in a learning theorem prover
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_13openalex-snapshot
Toward a calculus for abstract syntax trees
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_21openalex-snapshot
Program Transformations Directed by the Evaluation of non Functional Properties
inferred← citeshttps://doi.org/10.1007/978-1-4471-3558-6_17openalex-snapshot
Thoughts on a Larch/ML and a New Application for LP
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_7openalex-snapshot
Designing Unification Procedures Using Transformations: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_12openalex-snapshot
Deterministic Higher-Order Patterns for Program Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-30109-7_14openalex-snapshot
Generalization Algorithms for Second-Order Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_18openalex-snapshot
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_10openalex-snapshot
Decidable Variants of Higher-Order Unification
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_29openalex-snapshot
Second-Order Matching via Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_4openalex-snapshot
The Structure of Nuprl’s Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_8openalex-snapshot
Logic Programming and Meta-Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-78486-6_38openalex-snapshot
Towards Correctness, Efficiency and Reusability of Transformational Developments
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_8openalex-snapshot
Proof Analysis, Generalization and Reuse
inferred← citeshttps://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferred← citeshttps://doi.org/10.1007/bf00264438openalex-snapshot
Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique
inferred← citeshttps://doi.org/10.1007/bf00630923openalex-snapshot
Ellipsis and higher-order unification
inferred← citeshttps://doi.org/10.1007/bf00871692openalex-snapshot
Automated program understanding by concept recognition
inferred← citeshttps://doi.org/10.1007/bf00885767openalex-snapshot
Reduction and unification in lambda calculi with a general notion of subtype
inferred← citeshttps://doi.org/10.1007/bf00993253openalex-snapshot
Higher-order and modal logic as a framework for explanation-based generalization
inferred← citeshttps://doi.org/10.1007/bf01744293openalex-snapshot
Infinite trees in normal form and recursive equations having a unique solution
inferred← citeshttps://doi.org/10.1007/bf01744577openalex-snapshot
An axiomatic approach to the Korenjak-Hopcroft algorithms
inferred← citeshttps://doi.org/10.1007/bf01806061openalex-snapshot
Compiling lisp programs for parallel execution
inferred← citeshttps://doi.org/10.1007/bf01887212openalex-snapshot
Term rewriting and beyond — theorem proving in Isabelle
inferred← citeshttps://doi.org/10.1007/bf03037096openalex-snapshot
Synthesis of rewrite programs by higher-order and semantic unification
inferred← citeshttps://doi.org/10.1007/bfb0012882openalex-snapshot
λProlog: An extended logic programming language
inferred← citeshttps://doi.org/10.1007/bfb0013062openalex-snapshot
Building proofs by analogy via the Curry-Howard Isomorphism
inferred← citeshttps://doi.org/10.1007/bfb0013182openalex-snapshot
Dynamic term rewriting calculus and its application to inductive equational reasoning
inferred← citeshttps://doi.org/10.1007/bfb0014069openalex-snapshot
Third-order matching in the presence of type constructors
inferred← citeshttps://doi.org/10.1007/bfb0015465openalex-snapshot
Construction and deduction methods for the formal development of software
inferred← citeshttps://doi.org/10.1007/bfb0015467openalex-snapshot
Towards correct, efficient and reusable transformational developments
inferred← citeshttps://doi.org/10.1007/bfb0020000openalex-snapshot
The PROSPECTRA methodology and system: uniform transformational (meta-) development
inferred← citeshttps://doi.org/10.1007/bfb0030617openalex-snapshot
Linear interpolation for the higher-order matching problem
inferred← citeshttps://doi.org/10.1007/bfb0037103openalex-snapshot
The undecidability of typability in the Lambda-Pi-calculus
inferred← citeshttps://doi.org/10.1007/bfb0038698openalex-snapshot
A logic programming language with lambda-abstraction, function variables, and simple unification
inferred← citeshttps://doi.org/10.1007/s001650200011openalex-snapshot
The List Introduction Strategy for the Derivation of Logic Programs
inferred← citeshttps://doi.org/10.1007/s10472-021-09774-yopenalex-snapshot
Functions-as-constructors higher-order unification: extended pattern unification
inferred← citeshttps://doi.org/10.1007/s10817-018-9483-3openalex-snapshot
Mechanized Metatheory Revisited
inferred← citeshttps://doi.org/10.1007/s10817-019-09522-2openalex-snapshot
A Formalized General Theory of Syntax with Bindings: Extended Version
inferred← citeshttps://doi.org/10.1007/s10990-008-9038-0openalex-snapshot
Adapting functional programs to higher order logic
inferred← citeshttps://doi.org/10.1007/s10990-013-9097-8openalex-snapshot
Polynomial-time inverse computation for accumulative functions with multiple data traversals
inferred← citeshttps://doi.org/10.1016/0167-6423(92)90008-yopenalex-snapshot
Improving recursive functions by inverting the order of evaluation
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90015-2openalex-snapshot
A unification algorithm for second-order monadic terms
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot
Uniform proofs as a foundation for logic programming
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90083-3openalex-snapshot
Third order matching is decidable
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90142-1openalex-snapshot
Recursion induction principle revisited
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90024-vopenalex-snapshot
On the existence of speed-independent circuits
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90277-mopenalex-snapshot
More efficient bottom-up multi-pattern matching in trees
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90240-topenalex-snapshot
A theory of binding structures and applications to rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90166-xopenalex-snapshot
A compositional framework for fault tolerance by specification transformation
inferred← citeshttps://doi.org/10.1016/0743-1066(86)90002-6openalex-snapshot
Negation as inconsistency. I
inferred← citeshttps://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90028-0openalex-snapshot
Transformation of logic programs: Foundations and techniques
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90011-ropenalex-snapshot
Unification under a mixed prefix
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferred← citeshttps://doi.org/10.1016/b978-0-12-450010-5.50030-xopenalex-snapshot
Binding Structures
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50005-8openalex-snapshot
Automation of Higher-Order Logic
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50014-7openalex-snapshot
Recursive Applicative Program Schemes
inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50040-9openalex-snapshot
Program Abstraction and Instantiation An earlier version of this paper was presented at the Fifth Conference on Software Engineering, San Diego, Calif., March 1981.
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50025-5openalex-snapshot
Towards Inductive Generalisation in Higher Order Logic
inferred← citeshttps://doi.org/10.1016/j.future.2017.07.024openalex-snapshot
Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.12.008openalex-snapshot
Deterministic second-order patterns
inferred← citeshttps://doi.org/10.1016/j.jsc.2003.09.002openalex-snapshot
Tractable and intractable second-order matching problems
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.011openalex-snapshot
A survey of strategies in rule-based program transformation systems
inferred← citeshttps://doi.org/10.1016/j.scico.2015.08.007openalex-snapshot
Combinators for impure yet hygienic code generation
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00096-xopenalex-snapshot
Proving theorems by reuse
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00402-3openalex-snapshot
Higher-order matching for program transformation
inferred← citeshttps://doi.org/10.1016/s0304-3975(06)80003-4openalex-snapshot
Simple second-order languages for which unification is undecidable
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00084-4openalex-snapshot
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00184-9openalex-snapshot
A notation for lambda terms a generalization of environments
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00015-5openalex-snapshot
From context-free to definite-clause grammars: a type-theoretic approach
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80023-9openalex-snapshot
Higher-order unification revisited: Complete sets of transformations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00270-1openalex-snapshot
A Survey of Rewriting Strategies in Program Transformation Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80694-2openalex-snapshot
Computing With Contexts A simple approach
inferred← citeshttps://doi.org/10.1017/s0269888900008031openalex-snapshot
Developing correct and efficient logic programs by transformation
inferred← citeshttps://doi.org/10.1017/s0956796818000096openalex-snapshot
Applicative bidirectional programming
inferred← citeshttps://doi.org/10.1017/s0960129505004883openalex-snapshot
Matching with multiplication and exponentiation (extended abstract)
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of Logic Programming
inferred← citeshttps://doi.org/10.1023/a:1018952121991openalex-snapshot
Higher order generalization and its application in program verification
inferred← citeshttps://doi.org/10.1023/a:1022676712939openalex-snapshot
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
inferred← citeshttps://doi.org/10.1023/a:1022975408458openalex-snapshot
Derivation of Glue Code for Agent Interoperation
inferred← citeshttps://doi.org/10.1051/ita/1984180200911openalex-snapshot
Définitions récursives par cas
inferred← citeshttps://doi.org/10.1051/ita/1986200201491openalex-snapshot
La fonction d'Ackermann : un nouveau mode de dérécursivation
inferred← citeshttps://doi.org/10.1093/jigpal/11.1.51openalex-snapshot
Higher Order β Matching is Undecidable
inferred← citeshttps://doi.org/10.1093/jigpal/9.3.377openalex-snapshot
The rewriting calculus - part II
inferred← citeshttps://doi.org/10.1093/oso/9780198537618.003.0004openalex-snapshot
Designing a Theorem Prover
inferred← citeshttps://doi.org/10.1093/oso/9780198537922.003.0011openalex-snapshot
Higher-Order Logic Programming
inferred← citeshttps://doi.org/10.1109/32.184761openalex-snapshot
Program concept recognition and transformation
inferred← citeshttps://doi.org/10.1109/dac.1981.1585337openalex-snapshot
On Proving the Correctness of Optimizing Transformations in a Digital Design Automation System
inferred← citeshttps://doi.org/10.1109/icsm.2004.1357839openalex-snapshot
Quality-driven object-oriented re-engineering framework
inferred← citeshttps://doi.org/10.1109/ispse.2000.913246openalex-snapshot
Calculation carrying programs - how to code program transformations
inferred← citeshttps://doi.org/10.1109/kbse.1995.490115openalex-snapshot
CACHET: an interactive, incremental-attribution-based program transformation system for deriving incremental programs
inferred← citeshttps://doi.org/10.1109/kbse.1995.490133openalex-snapshot
Towards high-level deductive program synthesis based on type theory
inferred← citeshttps://doi.org/10.1109/lics.1992.185514openalex-snapshot
Third order matching is decidable
inferred← citeshttps://doi.org/10.1109/lics.2010.48openalex-snapshot
Strong Normalization for System F by HOAS on Top of FOAS
inferred← citeshttps://doi.org/10.1109/seke.1992.227955openalex-snapshot
Formal program developments directed by operational properties evaluation
inferred← citeshttps://doi.org/10.1109/sfcs.1978.26openalex-snapshot
on recursive equations having a unique solution
inferred← citeshttps://doi.org/10.1109/sfcs.1985.23openalex-snapshot
Equivalences and transformations of recursive definitions
inferred← citeshttps://doi.org/10.1109/superc.1988.44682openalex-snapshot
A transformational approach to the derivation of hardware algorithms from recurrence equations
inferred← citeshttps://doi.org/10.1109/tc.1983.1676294openalex-snapshot
An Abstract Model of Behavior for Hardware Descriptions
inferred← citeshttps://doi.org/10.1109/tcs.1981.1085036openalex-snapshot
A design methodology and computer aids for digital VLSI systems
inferred← citeshttps://doi.org/10.1109/tencon.1989.177109openalex-snapshot
Schematic rules within unfold/fold approach to program transformation
inferred← citeshttps://doi.org/10.1109/tse.1981.230814openalex-snapshot
Transformational Implementation: An Example
inferred← citeshttps://doi.org/10.1111/an.1960.1.5.3.3openalex-snapshot
Australian National University
inferred← citeshttps://doi.org/10.1145/1069774.1069780openalex-snapshot
Program transformation by templates based on term rewriting
inferred← citeshttps://doi.org/10.1145/1088454.1088456openalex-snapshot
A computational approach to reflective meta-reasoning about languages with bindings
inferred← citeshttps://doi.org/10.1145/115865.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferred← citeshttps://doi.org/10.1145/115866.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferred← citeshttps://doi.org/10.1145/1637837.1637839openalex-snapshot
Automatically computing functional instantiations
inferred← citeshttps://doi.org/10.1145/1656242.1656248openalex-snapshot
Proof search specifications of bisimulation and modal logics for the π-calculus
inferred← citeshttps://doi.org/10.1145/2103746.2103752openalex-snapshot
Polynomial-time inverse computation for accumulative functions with multiple data traversals
inferred← citeshttps://doi.org/10.1145/227699.227716openalex-snapshot
Total correctness by local improvement in the transformation of functional programs
inferred← citeshttps://doi.org/10.1145/234528.234529openalex-snapshot
Rules and strategies for transforming functional and logic programs
inferred← citeshttps://doi.org/10.1145/2543728.2543740openalex-snapshot
Combinators for impure yet hygienic code generation
inferred← citeshttps://doi.org/10.1145/268946.268953openalex-snapshot
A functional representation of data structures with a hole
inferred← citeshttps://doi.org/10.1145/2804302.2804309openalex-snapshot
Embedding a full linear Lambda calculus in Haskell
inferred← citeshttps://doi.org/10.1145/2847538.2847542openalex-snapshot
Finally, safely-extensible and efficient language-integrated query
inferred← citeshttps://doi.org/10.1145/2887747.2804309openalex-snapshot
Embedding a full linear Lambda calculus in Haskell
inferred← citeshttps://doi.org/10.1145/336595.337493openalex-snapshot
Derivation of glue code for agent interoperation
inferred← citeshttps://doi.org/10.1145/3374208openalex-snapshot
Symbolic Disintegration with a Variety of Base Measures
showing the first 200 of 248 · page through all 248
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.