Sciweavers

378 search results - page 41 / 76
» Higher-order transformation of logic programs
Sort
View
LOPSTR
2007
Springer
15 years 3 months ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
PEPM
2004
ACM
15 years 3 months ago
Proving termination of membership equational programs
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
Francisco Durán, Salvador Lucas, José...
LISP
2008
105views more  LISP 2008»
14 years 9 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
JELIA
2000
Springer
15 years 1 months ago
A Logic for Modeling Decision Making with Dynamic Preferences
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
Marina De Vos, Dirk Vermeir
PPDP
1999
Springer
15 years 2 months ago
Distributed Programming in a Multi-Paradigm Declarative Language
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...
Michael Hanus