Maurizio Proietti
Proceedings of the Fifth International Workshop on Logic Programming Synthesis and Transformation
LOPSTR, 1995.
@proceedings{LOPSTR-1995, address = "Utrecht, The Netherlands", editor = "Maurizio Proietti", isbn = "3-540-60939-3", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the Fifth International Workshop on Logic Programming Synthesis and Transformation}", volume = 1048, year = 1995, }
Contents (19 items)
- LOPSTR-1995-Leuschel #constraints #deduction
- Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints (ML), pp. 1–16.
- LOPSTR-1995-Wunderwald #evaluation #text-to-text
- Memoing Evaluation by Source-to-Source Transformation (JEW), pp. 17–32.
- LOPSTR-1995-BossiCE #order #problem #source code
- Transformation of Left Terminating Programs: the Reordering Problem (AB, NC, SE), pp. 33–45.
- LOPSTR-1995-Gregory #algorithm #concurrent
- Derivation of Concurrent Algorithms in Tempo (SG), pp. 46–60.
- LOPSTR-1995-ToniK #approach #logic programming #program transformation
- An Argumentation-Theoretic Approach to Logic Program Transformation (FT, RAK), pp. 61–75.
- LOPSTR-1995-Aarts #complexity #source code
- Complexity of Horn Programs (EA), pp. 76–90.
- LOPSTR-1995-GallardoT #abstract interpretation #cost analysis #framework #logic
- Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis (MdMG, JMT), pp. 91–105.
- LOPSTR-1995-Mesnard #automation #source code #towards
- Towards Automatic Control for CLP(x) Programs (FM), pp. 106–119.
- LOPSTR-1995-SemeraroEM #datalog #refinement #source code
- Ideal Refinement of Datalog Programs (GS, FE, DM), pp. 120–136.
- LOPSTR-1995-KreitzOS #development #proving
- Guiding Program Development Systems by a Connection Based Proof Strategy (CK, JO, SS), pp. 137–151.
- LOPSTR-1995-LauO #deduction #logic programming #object-oriented #source code #synthesis #towards
- Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs (KKL, MO), pp. 152–169.
- LOPSTR-1995-ParkesW #horn clause #induction #logic programming #synthesis
- Logic Program Synthesis by Induction over Horn Clauses (AJP, GAW), p. 170.
- LOPSTR-1995-FlenerD #logic programming #program transformation
- Logic Program Transformation through Generalization Schemata (PF, YD), pp. 171–173.
- LOPSTR-1995-VasconcelosF #approach #logic programming #optimisation #program analysis #using
- An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced Schema-Based Transformations (WWV, NEF), pp. 174–188.
- LOPSTR-1995-WaalT #deduction #problem #program analysis #program transformation #using
- Solving Deductive Planning Problems Using Program Analysis and Transformation (DAdW, MT), pp. 189–203.
- LOPSTR-1995-Renault #logic programming #proving #source code #towards
- Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion (SR), pp. 204–218.
- LOPSTR-1995-ArtsZ #logic programming #semantics #source code #termination #unification #using
- Termination of Logic Programs Using Semantic Unification (TA, HZ), pp. 219–233.
- LOPSTR-1995-Gluck #on the #program transformation
- On the Mechanics of Metasystem Hierarchies in Program Transformation (RG), pp. 234–251.
- LOPSTR-1995-Hanus #functional #lazy evaluation #logic programming #performance #prolog #source code
- Efficient Translation of Lazy Functional Logic Programs into Prolog (MH), pp. 252–266.
8 ×#logic programming
8 ×#source code
4 ×#program transformation
3 ×#deduction
3 ×#towards
3 ×#using
2 ×#approach
2 ×#problem
2 ×#program analysis
2 ×#proving
8 ×#source code
4 ×#program transformation
3 ×#deduction
3 ×#towards
3 ×#using
2 ×#approach
2 ×#problem
2 ×#program analysis
2 ×#proving