Skip to main content
SpringerLink
Log in

FMS: Functional Programming as a Modelling Language

  • 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:

  • 348 Accesses

Abstract

In this paper we introduce the Functional Modelling System (FMS). The system introduces the Functional Modelling Language (FML), which is a modelling language for NP-complete search problems based on concepts of functional programming. Internally, we translate FML specifications to an Answer Set Program to obtain models. We give a general overview of the new FML language, and how this language is handled in the system. We give a step-by-step walkthrough of the system, pointing out what features are in place, and what improvements are still possible.

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

Notes

  1. 1.

    The translation presented is slightly simplified for readability. The only difference lies in the omission of superfluous empty tuples.

References

  1. Appel, A.W.: Modern Compiler Implementation in C. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  2. Blockeel, H., et al.: Modeling machine learning and data mining problems with FO(\(\cdot \)). In: Dovier, A., Costa, V.S. (eds.) Proceedings of the 28th International Conference on Logic Programming - Technical Communications (ICLP 2012). LIPIcs, vol. 17, pp. 14–25. Schloss Daghstuhl - Leibniz-Zentrum fuer Informatik, September 2012

    Google Scholar 

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

    Google Scholar 

  4. 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 

  5. De Cat, B.: Separating knowledge from computation: an FO(\(\cdot \)) knowledge base system and its model expansion inference. Ph.D. thesis, KU Leuven, Leuven, Belgium, May 2014

    Google Scholar 

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

    Google Scholar 

  7. Jansen, J., Jorissen, A., Janssens, G.: Compiling input\(\ast \) FO(\(\cdot \)) inductive definitions into tabled Prolog rules for IDP3. TPLP 13(4–5), 691–704 (2013)

    MathSciNet  MATH  Google Scholar 

  8. Peyton Jones, S.L., Marlow, S.: Secrets of the Glasgow Haskell Compiler inliner. J. Funct. Program. 12(4&5), 393–433 (2002)

    MathSciNet  MATH  Google Scholar 

  9. Leuschel, M., Butler, M.: ProB: a model checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 855–874. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45236-2_46

    Chapter  Google Scholar 

  10. Marlow, S., Peyton Jones, S., Kmett, E., Mokhov, A.: Desugaring Haskell’s do-notation into applicative operations. In: Proceedings of the 9th International Symposium on Haskell, pp. 92–104. ACM (2016)

    Google Scholar 

  11. Microsoft. Language Server Protocol (2018)

    Google Scholar 

  12. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74970-7_38

    Chapter  Google Scholar 

  13. Parr, T.: The definitive ANTLR 4 reference. In: Pragmatic Bookshelf (2013)

    Google Scholar 

  14. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  15. Provetti, A., Son, T.C. (eds.): Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, Proceedings of the 1st International ASP 2001 Workshop, Stanford, 26–28 March 2001

    Google Scholar 

  16. Schrijvers, T., Stuckey, P.J., Wadler, P.: Monadic constraint programming. J. Funct. Program. 19(6), 663–697 (2009)

    Article  MathSciNet  Google Scholar 

  17. Peyton-Jones, S., Marlow, S.: The Glasgow Haskell Compiler (2012)

    Google Scholar 

  18. Wadler, P.: Comprehending monads. Math. Struct. Comput. Sci. 2(4), 461–493 (1992)

    Article  MathSciNet  Google Scholar 

  19. Wazny, J.R.: Type inference and type error diagnosis for Hindley/Milner with extensions. Citeseer (2006)

    Google Scholar 

  20. Wittocx, J., Mariën, M., Denecker, M.: Grounding with bounds. In: Fox, D., Gomes, C.P. (eds.) AAAI, pp. 572–577. AAAI Press (2008)

    Google Scholar 

  21. Wittocx, J., Mariën, M., Denecker, M.: Grounding FO and FO(ID) with bounds. J. Artif. Intell. Res. (JAIR) 38, 223–269 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Ingmar Dasseville & Gerda Janssens

Authors
  1. Ingmar Dasseville
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerda Janssens
    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., Janssens, G. (2019). FMS: Functional Programming as a Modelling Language. 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_9

Download citation

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

  • 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