research-article

Programming with singular and plural non-deterministic functions

Authors:

Adrián Riesco,

Juan Rodríguez-HortaláAuthors Info & Claims

PEPM '10: Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation

Pages 83 - 92

https://doi.org/10.1145/1706356.1706373

Published: 18 January 2010 Publication History

Abstract

Non-strict non-deterministic functions are one of the most distinctive features of functional-logic languages. Traditionally, two semantic alternatives have been considered for this kind of functions: call-time choice and run-time choice. While the former is the standard choice of modern implementations of FLP, the latter lacks some basic properties--mainly compositionality--that have prevented its use in practical FLP implementations. Recently, a new compositional plural semantics for FLP has been proposed. Although this semantics allows an elegant encoding of some problems--in particular those with an implicit manipulation of sets of values--, call-time choice still remains the best option for many common programming patterns.

In this paper we explore the expressive possibilities of the combination of singular and plural non-determinism. After formalizing the intended semantics by means of a logic calculus, several significant examples exploiting the capabilities of the semantics are presented. These examples have been tested and developed in a Maude-based prototype whose implementation is outlined.

References

[1]

E. Albert, M. Hanus, F. Huch, J. Oliver, and G. Vidal. Operational semantics for declarative multi-paradigm languages. Journal of Symbolic Computation, 40(1):795--829, 2005.

Digital Library

[2]

B. Braßel and F. Huch. On a tighter integration of functional and logic programming. In Proc. 5th Asian Symposium on Programming Languages and Systems (APLAS'07), Springer LNCS 4807, pages 122--138, 2007.

Digital Library

[3]

R. Caballero and F.J. López-Fraguas. Improving deterministic computations in lazy functional logic languages. Journal of Functional and Logic Programming, 2003, 2003.

[4]

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. All About Maude: A High-Performance Logical Framework, Springer LNCS 4350, 2007.

Digital Library

[5]

M. Clavel, J. Meseguer, and M. Palomino. Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic. Theoretical Computer Science, 373(1-2): 70--91, 2007.

Digital Library

[6]

S. Escobar. Implementing natural rewriting and narrowing efficiently. In Proc. 7th International Symposium on Functional and Logic Programming (FLOPS'04), Springer LNCS 2998, pages 147--162, 2004.

[7]

S. Fischer, O. Kiselyov, and C.-c. Shan. Purely functional lazy non-deterministic programming. In Proc. 14th ACM SIGPLAN international conference on Functional programming (ICFP '09), pages 11--22. ACM, 2009.

Digital Library

[8]

J. González-Moreno, M. Hortalá-González, and M. Rodríguez-Artalejo. A higher order rewriting logic for functional logic programming. In Proc. International Conference on Logic Programming (ICLP'97), pages 153--167. MIT Press, 1997.

[9]

J.C. González-Moreno, T. Hortalá-González, F. López-Fraguas, and M. Rodríguez-Artalejo. An approach to declarative programming based on a rewriting logic. Journal of Logic Programming, 40(1): 47--87, 1999.

[10]

M. Hanus. Functional logic programming: From theory to Curry. Technical report, Christian-Albrechts-Universität Kiel, 2005.

[11]

H. Hussmann. Non-Determinism in Algebraic Specifications and Algebraic Programs. Birkhäuser Verlag, 1993.

Digital Library

[12]

J. Launchbury. A natural semantics for lazy evaluation. In Proc. ACM Symposium on Principles of Programming Languages (POPL'93), pages 144--154. ACM, 1993.

Digital Library

[13]

F.J. López-Fraguas, J. Rodríguez-Hortalá, and J. Sánchez-Hernández. A lightweight combination of semantics for non-deterministic functions. In Proc. 18th Workshop on Logic-based methods in Programming Environments (WLPE'08), CoRR, abs/0903.2205, 2009.

[14]

F. López-Fraguas and J. Sánchez-Hernández. T OY : A multiparadigm declarative system. In Proc. Rewriting Techniques and Applications (RTA'99), pages 244--247. Springer LNCS 1631, 1999.

Digital Library

[15]

F. López-Fraguas, J. Rodríguez-Hortalá, and J. Sánchez-Hernández. A simple rewrite notion for call-time choice semantics. In Proc. Principles and Practice of Declarative Programming (PPDP'07), pages 197--208. ACM, 2007.

Digital Library

[16]

F. López-Fraguas, J. Rodríguez-Hortalá, and J. Sánchez-Hernández. Rewriting and call-time choice: the HO case. In Proc. 9th International Symposium on Functional and Logic Programming (FLOPS'08), Springer LNCS 4989, pages 147--162, 2008.

Digital Library

[17]

F. López-Fraguas, J. Rodríguez-Hortalá, and J. Sánchez-Hernández. A flexible framework for programming with non-deterministic functions. In Proc. 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation (PEPM'09), pages 91--100. ACM, 2009.

Digital Library

[18]

W. Lux. Curry mailing list: Type-classes and call-time choice vs. run-time choice. http://www.informatik.uni-kiel.de/~curry/listarchive/0790.html, August 2009.

[19]

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73--155, 1992.

Digital Library

[20]

R.J. Plasmeijer and M.C.J.D. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993.

Digital Library

[21]

A. Riesco and J. Rodríguez-Hortalá. A natural implementation of plural semantics in Maude. In Proc. 9th Workshop on Language Descriptions Tools and Applications (LDTA'09), 2009.

[22]

J. Rodríguez-Hortalá. Curry mailing list: Re: Type-classes and call-time choice vs. run-time choice. http://www.informatik.uni-kiel.de/~curry/listarchive/0801.html, August 2009.

[23]

J. Rodríguez-Hortalá. A hierarchy of semantics for non-deterministic term rewriting systems. In Proc. Foundations of Software Technology and Theoretical Computer Science (FSTTCS'08), 2008.

[24]

H. Søndergaard and P. Sestoft. Non-determinism in functional languages. The Computer Journal, 35(5):514--523, 1992.

Digital Library

[25]

A. Verdejo and N. Martí-Oliet. Two case studies of semantics execution in Maude: CCS and LOTOS. Formal Methods in System Design, 27:113--172, 2005.

Digital Library

[26]

P. Wadler. How to replace failure by a list of successes. In Proc. Functional Programming and Computer Architecture. Springer LNCS 201, 1985.

Digital Library

[27]

P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In Pro.16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 60--76. ACM, 1989.

Digital Library

[28]

D.H. Warren. Higher-order extensions to Prolog: are they needed? In J. Hayes, D. Michie, and Y.-H. Pao, editors, Machine Intelligence 10, pages 441--454. Ellis Horwood Ltd., 1982.

Cited By

Köksal AKuncak VSuter PField JHicks M(2012)Constraints as controlProceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2103656.2103675(151-164)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103656.2103675
Köksal AKuncak VSuter P(2012)Constraints as controlACM SIGPLAN Notices10.1145/2103621.210367547:1(151-164)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103621.2103675
RIESCO ARODRÍGUEZ-HORTALÁ J(2012)Singular and plural functions for functional logic programmingTheory and Practice of Logic Programming10.1017/S147106841200004X14:01(65-116)Online publication date: 17-May-2012
https://doi.org/10.1017/S147106841200004X
Show More Cited By

Index Terms

Programming with singular and plural non-deterministic functions
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
    2. General programming languages
      1. Language types
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Prototyping SOS Meta-theory in Maude

We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formulae, deduction rules and transition system specifications) in Maude. ...
Maude as a Platform for Designing and Implementing Deep Inference Systems

Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive systems with deep inference do not rely on the notion of main connective, ...
Evaluating epistemic negation in answer set programming

Epistemic negation not along with default negation plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing epistemic approaches such as those by Gelfond 13,15,14, Truszczynski 33 and Kahl et al. 18 behave not ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PEPM '10: Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation

January 2010

168 pages

ISBN:9781605587271

DOI:10.1145/1706356

Program Chairs:
John Gallagher
Roskilde University, Denmark, and IMDEA Software, Spain
,
Janis Voigtländer
University of Bonn, Germany

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 January 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PEPM '10

Sponsor:

SIGPLAN

PEPM '10: Partial Evaluation and Program Manipulation

January 18 - 19, 2010

Madrid, Spain

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
155
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Köksal AKuncak VSuter PField JHicks M(2012)Constraints as controlProceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2103656.2103675(151-164)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103656.2103675
Köksal AKuncak VSuter P(2012)Constraints as controlACM SIGPLAN Notices10.1145/2103621.210367547:1(151-164)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103621.2103675
RIESCO ARODRÍGUEZ-HORTALÁ J(2012)Singular and plural functions for functional logic programmingTheory and Practice of Logic Programming10.1017/S147106841200004X14:01(65-116)Online publication date: 17-May-2012
https://doi.org/10.1017/S147106841200004X
Alpuente MBallis DFalaschi M(2010)Transformation and debugging of functional logic programsA 25-year perspective on logic programming10.5555/1880413.1880427(271-299)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1880413.1880427
Christiansen JSeidel DVoigtländer JFilliâtre JFlanagan C(2010)Free theorems for functional logic programsProceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification10.1145/1707790.1707797(39-48)Online publication date: 19-Jan-2010
https://dl.acm.org/doi/10.1145/1707790.1707797
Alpuente MBallis DFalaschi M(2010)Transformation and Debugging of Functional Logic ProgramsA 25-Year Perspective on Logic Programming10.1007/978-3-642-14309-0_13(271-299)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14309-0_13

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten