scholarly journals A Practical Study of Control in Objected-Oriented–Functional–Logic Programming with Paisley

2017 ◽  
Vol 234 ◽  
pp. 150-164 ◽  
Author(s):  
Baltasar Trancón y Widemann ◽  
Markus Lepper
Keyword(s):  
Logic Programming ◽  
Functional Logic Programming ◽  
Functional Logic

Database query languages and functional logic programming

2006 ◽  
Vol 24 (2) ◽  
pp. 129-184
Author(s):  
Jesús M. Almendros-Jiménez ◽  
Antonio Becerra-Terón
Keyword(s):  
Logic Programming ◽  
Query Languages ◽  
Database Query ◽  
Functional Logic Programming ◽  
Functional Logic

scholarly journals Constraint functional logic programming over finite domains

2007 ◽  
Vol 7 (5) ◽  
pp. 537-582 ◽  
Author(s):  
ANTONIO J. FERNÁNDEZ ◽  
TERESA HORTALÁ-GONZÁLEZ ◽  
FERNANDO SÁENZ-PÉREZ ◽  
RAFAEL DEL VADO-VÍRSEDA
Keyword(s):  
Logic Programming ◽  
Operational Semantics ◽  
Point Of View ◽  
Finite Domain ◽  
Lazy Evaluation ◽  
Functional Logic Programming ◽  
Functional Logic ◽  
Finite Domains ◽  
Higher Order Functions ◽  
Domain Constraints

AbstractIn this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP($\fd$)) with a lazy functional logic programming language which seamlessly embodies finite domain ($\fd$) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP($\fd$)) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe\toy(fd)$, an implementation forCFLP($\fd$), and a comparison of our approach with respect toCLP($\fd$) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existingCLP($\fd$) systems and that clearly outperforms the closer approach toCFLP($\fd$).

Sign in / Sign up

Export Citation Format

Share Document