Kernel-LEAF

Kernel-LEAF: A logic plus functional language. Kernel-LEAF is a logic plus functional language based on the flattening technique. It differs from other similar languages because it is able to cope with partial (undefined or non-terminating) functions. This is achieved by introducing the distinction between data structures and (functional) term structures, and by using two kinds of equality. The language has a clean model-theoretic semantics, where the domains of the interpretations are the algebraic CPOs. In these domains the difference between the two equalities corresponds to a different behaviour with respect to continuity. The operational semantics (based on SLD-resolution) is proved sound and complete with respect to the model-theoretic one. Finally, an outermost strategy, more efficient than unrestricted SLD-resolution, but still complete, is presented.


References in zbMATH (referenced in 29 articles )

Showing results 1 to 20 of 29.
Sorted by year (citations)

1 2 next

  1. Hanus, Michael: Functional logic programming: from theory to curry (2013)
  2. Alpuente, M.; Ballis, D.; Correa, F.; Falaschi, M.: An integrated framework for the diagnosis and correction of rule-based programs (2010)
  3. Antoy, Sergio: Programming with narrowing: a tutorial (2010)
  4. Ramos, J.Guadalupe; Silva, Josep; Vidal, Germán: Ensuring the quasi-termination of needed narrowing computations (2007)
  5. Simon, Luke; Bansal, Ajay; Mallya, Ajay; Gupta, Gopal: Co-logic programming: Extending logic programming with coinduction (2007)
  6. Albert, Elvira; Hanus, Michael; Huch, Frank; Oliver, Javier; Vidal, Germán: Operational semantics for declarative multi-paradigm languages (2005)
  7. Antoy, Sergio: Evaluation strategies for functional logic programming (2005)
  8. Escobar, Santiago; Meseguer, José; Thati, Prasanna: Natural narrowing for general term rewriting systems (2005)
  9. Peltier, Nicolas: A proof procedure for functional first order logic programs with non-deterministic lazy functions and built-in predicates (2004)
  10. Vidal, Germán: Cost-augmented partial evaluation of functional logic programs (2004)
  11. Albert, Elvira; Hanus, Michael; Huch, Frank; Oliver, Javier; Vidal, Germán: An operational semantics for declarative multi-paradigm languages. (2002)
  12. Albert, Elvira; Vidal, Germán: The narrowing-driven approach to functional logic program specialization (2002)
  13. Alpuente, María; Correa, Francisco J.; Falaschi, Moreno: A debugging scheme for functional logic programs. (2002)
  14. Antoy, Sergio; Iranzo, Pascual Julián; Massey, Bart: Improving the efficiency of non-deterministic computations. (2002)
  15. Caballero, Rafael; Rodríguez-Artalejo, Mario: A declarative debugging system for lazy functional logic programs. (2002)
  16. Albert, Elvira: Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency (2001)
  17. Albert, Elvira; Antoy, Sergio; Vidal, Germán: Measuring the effectiveness of partial evaluation in functional logic languages (2001)
  18. Almendros-Jiménez, Jesús M.; Becerra-Terón, Antonio: A framework for goal-directed bottom-up evaluation of functional logic programs (2001)
  19. Alpuente, María; Correa, Francisco J.; Falaschi, Moreno: Declarative debugging of functional logic programs. (2001)
  20. Arenas-Sánchez, Puri; Rodríguez-Artalejo, Mario: A general framework for lazy functional logic programming with algebraic polymorphic types (2001)

1 2 next