Publication:4414739
From MaRDI portal
zbMath1026.68028MaRDI QIDQ4414739
Publication date: 27 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2566/25660379.htm
program analysisterminationlogic programmingfunctional programmingmetaprogrammingwell-quasi ordersinfinite model checkingspecialisation and transformation
Functional programming and lambda calculus (68N18) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Rules + strategies for transforming lazy functional logic programs, E-Unification based on Generalized Embedding, Rewriting-based repairing strategies for XML repositories, The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings, Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation, A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs, A framework for computing finite SLD trees, Efficient and flexible access control via Jones-optimal logic program specialisation, Type-based homeomorphic embedding for online termination, Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*, Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Uses Software