Programming Language Implementation and Logic Programming: International Workshop Plilp '90 Linkoping, Sweden, August 20-22, 1990 Proceedings
Pierre Deransart, Jan Małuszyński
Abstract
Pierre Deransart, Jan Małuszyński
Abstract
Implementing parallel rewriting.- Compilation of narrowing.- Inference-based overloading resolution for ADA.- An approach to verifiable compiling specification and prototyping.- Bug localization by algorithmic debugging and program slicing.- A constraint logic programming shell.- Modifying the simplex algorithm to a constraint solver.- Implementing a meta-logical scheme.- The vienna abstract machine.- A new data structure for implementing extensions to Prolog.- Finding the least fixed point using wait-declarations in Prolog.- Elementary logic programs.- A new presburger arithmetic decision procedure based on extended prolog execution.- Reasoning about programs with effects.- Towards a characterization of termination of logic programs.- Static type analysis of prolog procedures for ensuring correctness.- Integrating strict and lazy evaluation: the ?sl-calculus.- Efficient data representation in polymorphic languages.- A logic-based approach to data flow analysis problems.- Systematic semantic approximations of logic programs.- Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity.- On the automatic generation of events in delta prolog.- Compilation of non-linear, second order patterns on S-expressions.- Pattern matching in a functional transformation language using treeparsing.- Logic programming within a functional framework.- Compiling logic programs with equality.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Implementing parallel rewriting.- Compilation of narrowing.- Inference-based overloading resolution for ADA.- An approach to verifiable compiling specification and prototyping.- Bug localization by algorithmic debugging and program slicing.- A constraint logic programming shell.- Modifying the simplex algorithm to a constraint solver.- Implementing a meta-logical scheme.- The vienna abstract machine.- A new data structure for implementing extensions to Prolog.- Finding the least fixed point using wait-declarations in Prolog.- Elementary logic programs.- A new presburger arithmetic decision procedure based on extended prolog execution.- Reasoning about programs with effects.- Towards a characterization of termination of logic programs.- Static type analysis of prolog procedures for ensuring correctness.- Integrating strict and lazy evaluation: the ?sl-calculus.- Efficient data representation in polymorphic languages.- A logic-based approach to data flow analysis problems.- Systematic semantic approximations of logic programs.- Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity.- On the automatic generation of events in delta prolog.- Compilation of non-linear, second order patterns on S-expressions.- Pattern matching in a functional transformation language using treeparsing.- Logic programming within a functional framework.- Compiling logic programs with equality.
Key concepts: Programming language, Computer science, Prolog, Logic programming, Horn clause, Constraint logic programming, Functional logic programming, Theoretical computer science