Instructed late binding

Seyed H. Haeri, Paul Keir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Downloads (Pure)

Abstract

Integration of a decentralised pattern matching is a technique that enables a recent solution to the Expression Problem. The single former implementation of this technique was in Scala. In this paper, we highlight the C++ implementation of the same technique to solve the Expression Problem in C++. Unlike the former implementation which relies on stackability of Scala traits, this new implementation relies on compile-time metaprogramming for automatic iterative pointer introspection at runtime. That iteration enables late binding using overload resolution, which the compiler is already capable of. The C++ implementation outperforms the Scala one by providing strong static type safety and offering considerably easier usage.
Original languageEnglish
Title of host publicationProceedings of the 23rd Panhellenic Conference on Informatics (PCI 2019)
PublisherACM Press
Pages135-142
Number of pages8
ISBN (Print)9781450372923
DOIs
Publication statusPublished - 5 Dec 2019
Event23rd Pan-Hellenic Conference on Informatics - University of Nicosia, Nicosia, Cyprus
Duration: 28 Nov 201930 Nov 2019
http://www.unic.ac.cy/pci2019/

Conference

Conference23rd Pan-Hellenic Conference on Informatics
Abbreviated titlePCI 2019
CountryCyprus
CityNicosia
Period28/11/1930/11/19
Internet address

    Fingerprint

Keywords

  • Expression Problem
  • Overload Resolution
  • Metaprogramming
  • C++
  • Functional Programming

Cite this

Haeri, S. H., & Keir, P. (2019). Instructed late binding. In Proceedings of the 23rd Panhellenic Conference on Informatics (PCI 2019) (pp. 135-142). ACM Press. https://doi.org/10.1145/3368640.3368644