Instructed late binding

Seyed H. Haeri; Paul Keir

doi:10.1145/3368640.3368644

Instructed late binding

Seyed H. Haeri, Paul Keir

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

135 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 language	English
Title of host publication	Proceedings of the 23rd Panhellenic Conference on Informatics (PCI 2019)
Publisher	ACM Press
Pages	135-142
Number of pages	8
ISBN (Print)	9781450372923
DOIs	https://doi.org/10.1145/3368640.3368644
Publication status	Published - 5 Dec 2019
Event	23rd Pan-Hellenic Conference on Informatics - University of Nicosia, Nicosia, Cyprus Duration: 28 Nov 2019 → 30 Nov 2019 http://www.unic.ac.cy/pci2019/

Conference

Conference	23rd Pan-Hellenic Conference on Informatics
Abbreviated title	PCI 2019
Country/Territory	Cyprus
City	Nicosia
Period	28/11/19 → 30/11/19
Internet address	http://www.unic.ac.cy/pci2019/

Keywords

Expression Problem
Overload Resolution
Metaprogramming
C++
Functional Programming

Access to Document

10.1145/3368640.3368644

2019 10 22 Haeri et al Binding acceptedAccepted author manuscript, 758 KB

Cite this

@inproceedings{6fbb479d201e44f28ed93db07e6244f2,

title = "Instructed late binding",

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.",

keywords = "Expression Problem, Overload Resolution, Metaprogramming, C++, Functional Programming",

author = "Haeri, {Seyed H.} and Paul Keir",

year = "2019",

month = dec,

day = "5",

doi = "10.1145/3368640.3368644",

language = "English",

isbn = "9781450372923",

pages = "135--142",

booktitle = "Proceedings of the 23rd Panhellenic Conference on Informatics (PCI 2019)",

publisher = "ACM Press",

address = "United States",

note = "23rd Pan-Hellenic Conference on Informatics, PCI 2019 ; Conference date: 28-11-2019 Through 30-11-2019",

url = "http://www.unic.ac.cy/pci2019/",

}

TY - GEN

T1 - Instructed late binding

AU - Haeri, Seyed H.

AU - Keir, Paul

PY - 2019/12/5

Y1 - 2019/12/5

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

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

KW - Expression Problem

KW - Overload Resolution

KW - Metaprogramming

KW - C++

KW - Functional Programming

U2 - 10.1145/3368640.3368644

DO - 10.1145/3368640.3368644

M3 - Conference contribution

SN - 9781450372923

SP - 135

EP - 142

BT - Proceedings of the 23rd Panhellenic Conference on Informatics (PCI 2019)

PB - ACM Press

T2 - 23rd Pan-Hellenic Conference on Informatics

Y2 - 28 November 2019 through 30 November 2019

ER -

Instructed late binding

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this