Skip to main content
SpringerLink
Log in

Transpiling Programming Computable Functions to Answer Set Programs

  • Conference paper
  • First Online:
Functional and Constraint Logic Programming (WFLP 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11285))

Included in the following conference series:

  • 366 Accesses

Abstract

Programming Computable Functions (PCF) is a simplified programming language which provides the theoretical basis of modern functional programming languages. Answer set programming (ASP) is a programming paradigm focused on solving search problems. In this paper we provide a translation from PCF to ASP. Using this translation it becomes possible to specify search problems using PCF.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  2. Calimeri, F., et al.: ASP-Core-2 input language format. Technical report, ASP Standardization Working Group (2013)

    Google Scholar 

  3. Chen, W., Kifer, M., Warren, D.S.: HiLog: a foundation for higher-order logic programming. J. Log. Program. 15(3), 187–230 (1993)

    Article  MathSciNet  Google Scholar 

  4. Clément, D., Despeyroux, J., Despeyroux, T., Kahn, G.: A simple applicative language: mini-ML. In: LISP and Functional Programming, pp. 13–27 (1986)

    Google Scholar 

  5. Dargaye, Z., Leroy, X.: Mechanized verification of CPS transformations. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 211–225. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75560-9_17

    Chapter  Google Scholar 

  6. Dasseville, I., van der Hallen, M., Bogaerts, B., Janssens, G., Denecker, M.: A compositional typed higher-order logic with definitions. In: Carro, M., King, A., De Vos, M., Saeedloei, N. (eds.) ICLP 2016. OASIcs, vol. 52, pp. 14.1–14.14. Schloss Dagstuhl, November 2016

    Google Scholar 

  7. Dasseville, I., van der Hallen, M., Janssens, G., Denecker, M.: Semantics of templates in a compositional framework for building logics. TPLP 15(4–5), 681–695 (2015)

    MathSciNet  MATH  Google Scholar 

  8. Dowek, G., Lévy, J.-J.: Introduction to the Theory of Programming Languages. Undergraduate Topics in Computer Science. Springer, Heidelberg (2011). https://doi.org/10.1007/978-0-85729-076-2

    Book  MATH  Google Scholar 

  9. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: preliminary report. CoRR, abs/1405.3694 (2014)

    Google Scholar 

  10. Gratzer, D.: A tiny compiler for a typed higher order language (2015)

    Google Scholar 

  11. Ianni, G., Ielpa, G., Pietramala, A., Santoro, M.C., Calimeri, F.: Enhancing answer set programming with templates. In: Delgrande, J.P., Schaub, T. (eds.) Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, Canada, 6–8 June 2004, pp. 233–239 (2004)

    Google Scholar 

  12. Kaufmann, B., Leone, N., Perri, S., Schaub, T.: Grounding and solving in answer set programming. AI Mag. 37(3), 25–32 (2016)

    Article  Google Scholar 

  13. Mumick, I.S., Finkelstein, S.J., Pirahesh, H., Ramakrishnan, R.: Magic is relevant. In: Garcia-Molina, H., Jagadish, H.V. (eds.) Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, 23–25 May 1990, pp. 247–258. ACM Press (1990)

    Google Scholar 

  14. Niemelä, I.: Answer set programming: a declarative approach to solving search problems. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 15–18. Springer, Heidelberg (2006). https://doi.org/10.1007/11853886_2

    Chapter  Google Scholar 

  15. Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(3), 223–255 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, KU Leuven, 3001, Leuven, Belgium

    Ingmar Dasseville & Marc Denecker

Authors
  1. Ingmar Dasseville
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Denecker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ingmar Dasseville .

Editor information

Editors and Affiliations

  1. Universitat Politècnica de València, Valencia, Spain

    Josep Silva

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dasseville, I., Denecker, M. (2019). Transpiling Programming Computable Functions to Answer Set Programs. In: Silva, J. (eds) Functional and Constraint Logic Programming. WFLP 2018. Lecture Notes in Computer Science(), vol 11285. Springer, Cham. https://doi.org/10.1007/978-3-030-16202-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-16202-3_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-16201-6

  • Online ISBN: 978-3-030-16202-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation