Francisco Javier Lopez-Fraguas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Francisco Javier Lopez-Fraguas has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Jaime Sánchez-Hernández
Complutense University of Madrid
13 shared publications Juan Rodríguez-Hortalá
Universidad Complutense de Madrid
10 shared publications- Enrique Martin-Martin
Complutense University of Madrid
7 shared publications M. Rodríguez-Artalejo
Universidad Complutense de Madrid, Madrid, Spain
4 shared publications- Rafael Caballero
Universidad Complutense de Madrid
3 shared publications Rafael del Vado Vírseda
Facultad de Informática de la Universidad Complutense de Madrid
3 shared publications
Latest Publications
- 1 June 2020
- Published by Elsevier in Journal of Computer Languages
- Vol. 58
Deriving overloaded success type schemes in Erlang
- 1 June 2020
- Published by Elsevier in Journal of Computer Languages
- Vol. 58
Deriving overloaded success type schemes in Erlang
- 21 February 2016
- Published by Springer Nature
- p. 181-197
Polymorphic Types in Erlang Function Specifications
- 21 February 2016
- Published by Springer Nature
- p. 181-197
Polymorphic Types in Erlang Function Specifications
- 10 November 2014
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 25 (4) , 942-977
A liberal type system for functional logic programs
We propose a new type system for functional logic programming which is more liberal than the classical Damas–Milner usually adopted, but it is also restrictive enough to ensure type soundness. Starting from Damas–Milner typing of expressions, we propose a new notion of well-typed program that adds support for type-indexed functions, a particular form of existential types, opaque higher-order patterns and generic functions – as shown by an extensive collection of examples that illustrate the possibilities of our proposal. In the negative side, the types of functions must be declared, and therefore types are checked but not inferred. Another consequence is that parametricity is lost, although the impact of this flaw is limited as ‘free theorems’ were already compromised in functional logic programming because of non-determinism.
- 10 November 2014
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 25 (4) , 942-977
A liberal type system for functional logic programs
We propose a new type system for functional logic programming which is more liberal than the classical Damas–Milner usually adopted, but it is also restrictive enough to ensure type soundness. Starting from Damas–Milner typing of expressions, we propose a new notion of well-typed program that adds support for type-indexed functions, a particular form of existential types, opaque higher-order patterns and generic functions – as shown by an extensive collection of examples that illustrate the possibilities of our proposal. In the negative side, the types of functions must be declared, and therefore types are checked but not inferred. Another consequence is that parametricity is lost, although the impact of this flaw is limited as ‘free theorems’ were already compromised in functional logic programming because of non-determinism.
- 1 April 2014
- Published by Elsevier in Information and Computation
- Vol. 235, 36-69
Safe typing of functional logic programs with opaque patterns and local bindings
- 1 April 2014
- Published by Elsevier in Information and Computation
- Vol. 235, 36-69
Safe typing of functional logic programs with opaque patterns and local bindings
- Open Access
- 21 January 2013
- Published by Association for Computing Machinery (ACM)
- p. 23-32
Typing as functional-logic evaluation
- 21 January 2013
- Published by Association for Computing Machinery (ACM)
- p. 23-32
Open AccessTyping as functional-logic evaluation
- 30 October 2012
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 14 (2) , 165-213
Rewriting and narrowing for constructor systems with call-time choice semantics
Non-confluent and non-terminating {constructor-based term rewriting systems are useful for the purpose of specification and programming. In particular, existing functional logic languages use such kinds of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism iscall-time choice, whose combination with non-strictness is a non-trivial issue, addressed years ago from a semantic point of view with the Constructor-based Rewriting Logic (CRWL), a well-known semantic framework commonly accepted as suitable semantic basis of modern functional logic languages. A drawback of CRWL is that it does not come with a proper notion of one-step reduction, which would be very useful to understand and reason about how computations proceed. In this paper, we develop thoroughly the theory for the first-order version of let-rewriting, a simple reduction notion close to that of classical term rewriting, but extended with a let-binding construction to adequately express the combination of call-time choice with non-strict semantics. Let-rewriting can be seen as a particular textual presentation of term graph rewriting. We investigate the properties of let-rewriting, most remarkably their equivalence with respect to a conservative extension of the CRWL-semantics coping with let-bindings, and we show by some case studies that having two interchangeable formal views (reduction/semantics) of the same language is a powerful reasoning tool. After that, we provide a notion of let-narrowing, which is adequate for call-time choice as proved by soundness and completeness results of let-narrowing with respect to let-rewriting. Moreover, we relate those let-rewriting and let-narrowing relations (and hence CRWL) with ordinary term rewriting and narrowing, providing in particular soundness and completeness of let-rewriting with respect to term rewriting for a class of programs which are deterministic in a semantic sense.
- 30 October 2012
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 14 (2) , 165-213
Rewriting and narrowing for constructor systems with call-time choice semantics
Non-confluent and non-terminating {constructor-based term rewriting systems are useful for the purpose of specification and programming. In particular, existing functional logic languages use such kinds of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism iscall-time choice, whose combination with non-strictness is a non-trivial issue, addressed years ago from a semantic point of view with the Constructor-based Rewriting Logic (CRWL), a well-known semantic framework commonly accepted as suitable semantic basis of modern functional logic languages. A drawback of CRWL is that it does not come with a proper notion of one-step reduction, which would be very useful to understand and reason about how computations proceed. In this paper, we develop thoroughly the theory for the first-order version of let-rewriting, a simple reduction notion close to that of classical term rewriting, but extended with a let-binding construction to adequately express the combination of call-time choice with non-strict semantics. Let-rewriting can be seen as a particular textual presentation of term graph rewriting. We investigate the properties of let-rewriting, most remarkably their equivalence with respect to a conservative extension of the CRWL-semantics coping with let-bindings, and we show by some case studies that having two interchangeable formal views (reduction/semantics) of the same language is a powerful reasoning tool. After that, we provide a notion of let-narrowing, which is adequate for call-time choice as proved by soundness and completeness results of let-narrowing with respect to let-rewriting. Moreover, we relate those let-rewriting and let-narrowing relations (and hence CRWL) with ordinary term rewriting and narrowing, providing in particular soundness and completeness of let-rewriting with respect to term rewriting for a class of programs which are deterministic in a semantic sense.
- Open Access
Rewriting and narrowing for constructor systems with call-time choice semantics
Non-confluent and non-terminating constructor-based term rewrite systems are useful for the purpose of specification and programming. In particular, existing functional logic languages use such kind of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is a non trivial issue, addressed years ago from a semantic point of view with the Constructor-based Rewriting Logic (CRWL), a well-known semantic framework commonly accepted as suitable semantic basis of modern functional logic languages. A drawback of CRWL is that it does not come with a proper notion of one-step reduction, which would be very useful to understand and reason about how computations proceed. In this paper we develop thoroughly the theory for the first order version of let-rewriting, a simple reduction notion close to that of classical term rewriting, but extended with a let-binding construction to adequately express the combination of call-time choice with non-strict semantics. Let-rewriting can be seen as a particular textual presentation of term graph rewriting. We investigate the properties of let-rewriting, most remarkably their equivalence with respect to a conservative extension of the CRWL-semantics coping with let-bindings, and we show by some case studies that having two interchangeable formal views (reduction/semantics) of the same language is a powerful reasoning tool. After that, we provide a notion of let-narrowing which is adequate for call-time choice as proved by soundness and completeness results of let-narrowing with respect to let-rewriting. Moreover, we relate those let-rewriting and let-narrowing relations (and hence CRWL) with ordinary term rewriting and narrowing (..) To appear in Theory and Practice of Logic Programming (TPLP).
Open AccessRewriting and narrowing for constructor systems with call-time choice semantics
Non-confluent and non-terminating constructor-based term rewrite systems are useful for the purpose of specification and programming. In particular, existing functional logic languages use such kind of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is a non trivial issue, addressed years ago from a semantic point of view with the Constructor-based Rewriting Logic (CRWL), a well-known semantic framework commonly accepted as suitable semantic basis of modern functional logic languages. A drawback of CRWL is that it does not come with a proper notion of one-step reduction, which would be very useful to understand and reason about how computations proceed. In this paper we develop thoroughly the theory for the first order version of let-rewriting, a simple reduction notion close to that of classical term rewriting, but extended with a let-binding construction to adequately express the combination of call-time choice with non-strict semantics. Let-rewriting can be seen as a particular textual presentation of term graph rewriting. We investigate the properties of let-rewriting, most remarkably their equivalence with respect to a conservative extension of the CRWL-semantics coping with let-bindings, and we show by some case studies that having two interchangeable formal views (reduction/semantics) of the same language is a powerful reasoning tool. After that, we provide a notion of let-narrowing which is adequate for call-time choice as proved by soundness and completeness results of let-narrowing with respect to let-rewriting. Moreover, we relate those let-rewriting and let-narrowing relations (and hence CRWL) with ordinary term rewriting and narrowing (..) To appear in Theory and Practice of Logic Programming (TPLP).
- Open Access
- 23 January 2012
- Published by Association for Computing Machinery (ACM)
- p. 83-92
Well-typed narrowing with extra variables in functional-logic programming
- 23 January 2012
- Published by Association for Computing Machinery (ACM)
- p. 83-92
Open AccessWell-typed narrowing with extra variables in functional-logic programming
- 1 January 2010
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 118-133
A Complete Axiomatization of Strict Equality
- 1 January 2010
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 118-133
A Complete Axiomatization of Strict Equality
- 1 January 2010
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 128-144
New Results on Type Systems for Functional Logic Programming
- 1 January 2010
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 128-144
New Results on Type Systems for Functional Logic Programming