My general interest is in Programming Languages (PLs). I like both its theory and practice. But, what I like even more is reconciling the two.
My history in PL research can be divided into four major categories: formal semantics of lazy evaluation, generic programming, language mechanisation, and distributed systems programming.
Guest Lecturer in "Programming Paradigms" (Hosted by Kim Mens) of UCLouvain, Belgium
Software Engineering, Software Seminar, Software Proseminar, Advanced Programming, Data Structures and Algorithms, Design and Analysis of Algorithms, Data Structures and Algorithms II , Theory of Formal Languages and Automata, Distributed Systems, and Computer Graphics
- (2023). Algebraic Reasoning About Timeliness. Electronic Proceedings in Theoretical Computer Science (EPTCS). 35-54.
- (2022). Mind Your Outcomes: The ∆QSD Paradigm for Quality-Centric Systems Development and Its Application to a Blockchain Case Study<sup>†</sup>. Computers. 38 pages.
- (2022). On the Algebraic Properties of Timeliness. .
 S. H. Haeri and P. Van Roy, ‘A Family of λ-Calculi with Ports’, in 21st TFP, Accepted, Kraków, Poland: LNCS, Feb. 2020. [Online]. Available: http://hdl.handle.net/2078.1/228133.
 ——, ‘Piecewise Relative Observational Purity’, in 4th ProWeb, Accepted, Porto, Portugal: ACM, Mar. 2020.
 S. H. Haeri and P. Keir, ‘Composition of Languages Embedded in Scala’, in 14th FedCSIS, M. Ganzha, L. Maciaszek and M. Paprzycki, Eds., Leipzig, Germany: IEEE, Sep. 2019, pp. 399–410. doi: 10.15439/2019F61.
 ——, ‘Instructed Late Binding’, in 23rd PCI, H. Gjermundrod, Ed., Nicosia, Cyprus: ACM, Nov. 2019, pp. 135–142, isbn: 978-1-4503-7292-3. doi: 10.1145/3368640.3368644.
 ——, ‘Solving the Expression Problem in C++, à la LMS’, in 16th ICTAC, R. M. Hierons and M. Mosbah, Eds., ser. LNCS, vol. 11884, Hammamet, Tunisia: Springer, Cham, Nov. 2019, pp. 353–371, isbn: 978-3-030-32504-6. doi: 10.1007/978-3-030-32505-3_20.
 S. H. Haeri and P. Van Roy, ‘Marking Piecewise Observable Purity’, in 31st NWPT, J. Vain and T. Uustalu, Eds., Tallinn, Estonia: TTU, Nov. 2019, pp. 29–32, isbn: 978-9949-83-520-1.
 P. Keir, A. Gozillon and S. H. Haeri, ‘Intrinsic Currying for C++ Template Metaprograms’, in 19th TFP, M. Palka and M. Myreen, Eds., ser. LNCS, vol. 11457, Gothenburg, Sweden: Springer Int. Pub., Jun. 2018, pp. 46–73. doi: 10.1007/978-3-030-18506-0_3.
 S. H. Haeri and S. Schupp, ‘Integration of a Decentralised Pattern Matching: Venue for a New Paradigm Intermarriage’, in 8th SCSS, M. Mosbah and M. Rusinowitch, Eds., ser. EPiC Comp. Vol. 45, Gammarth, Tunisia: EasyChair, Apr. 2017, pp. 16–28. doi: 10.29007/k919.
 ——, ‘Expression Compatibility Problem’, in 7th SCSS, J. H. Davenport and F. Ghourabi, Eds., ser. EPiC Comp. Vol. 39, Tokyo, Japan: EasyChair, Mar. 2016, pp. 55–67. doi: 10.29007/xlbn.
 S. H. Haeri and P. Van Roy, ‘An Operational Semantics for Multicasting Systems with Monotonic Values’, in 28th NWPT, K. G. Larsen and J. Srba, Eds., Rold Storkroen, Denmark, Nov. 2016, pp. 58–60.
 S. H. Haeri, P. Van Roy, C. Baquero and C. Meiklejohn, ‘Worlds of Events: Deduction with Partial Knowledge about Causality’, in 9th ICE, M. Bartoletti, L. Henrio, S. Knight and H. T. Vieira, Eds., ser. ENTCS, vol. 223, Heraklion, Greece, Jun. 2016, pp. 113–127. doi: 10.4204/EPTCS.223.8.
 C. Meiklejohn, S. H. Haeri and P. Van Roy, ‘Declarative, Sliding Window Aggregations for Computations at the Edge’, in 13th CCNC, Las Vegas, USA: IEEE, Jan. 2016, pp. 32–37. doi: 10.1109/CCNC.2016.7444727.
 S. H. Haeri and S. Schupp, ‘Distributed Lazy Evaluation: A Big-Step Mechanised Semantics’, in 4PAD’14, Turin, Italy: IEEE, Feb. 2014, pp. 751–755. doi: 10.1109/PDP.2014.43.
 ——, ‘Reusable Components for Lightweight Mechanisation of Programming Languages’, in 12th SC, W. Binder, E. Bodden and W. Löwe, Eds., ser. LNCS, vol. 8088, Budapest, Hungary: Springer, Jun. 2013, pp. 1–16. doi: 10.1007/978-3-642-39614-4\_1.
 S. H. Haeri, J. Hüser and S. Schupp, ‘Using Functional Languages to Facilitate C++ Metaprogramming’, in 8th WGP, Copenhagen, Denmark: ACM, Sep. 2012, pp. 33–44. doi: 10.1145/2364394.2364400.
 S. H. Haeri and S. Schupp, ‘Functional Metaprogramming in C++ and Cross-Lingual Development with Haskell’, U. Kansas, Tech. Rep., Oct. 2011, Draft Proc. 23rd IFL, ITTC-FY2012-TR-29952012-01.
 S. H. Haeri, ‘Observational Equivalence and a New Operational Semantics for Lazy Evaluation with Selective Strictness’, in TMFCS-10, Z. Majkic, S.-Y. Hsieh, J. Ma, I. M. M. El Emary and K. S. Husain, Eds., Orlando, Florida, USA, Jul. 2010, pp. 143–150, isbn: 978-1-60651-024-7.
 V. Qazvinian, H. Abolhassani and S. H. Haeri, ‘Evolutionary Coincidence-Based Ontology Mapping Extraction’, J. Know. Eng., Spec. Issue Adv. Ont. Expert Sys., vol. 25, no. 3, pp. 221–236, Jul. 2008. doi: 10.1111/j.1468-0394.2008.00462.x.
 S. H. Haeri, H. Abolhassani, V. Qazvinian and B. Bagheri Hariri, ‘Coincidence-Based Scoring of Mappings in Ontology Alignment’, J. Adv. Comp. Intellig., vol. 11, no. 7, pp. 803–816, May 2007. doi: 10.20965/jaciii.2007.p0803.
 V. Qazvinian, H. Abolhassani and S. H. Haeri, ‘Coincidence-Based Mapping Extraction with Genetic Algorithms’, in 3rd WEBIST, Barcelona, Spain, Mar. 2007, pp. 176–183. doi: 10.5220/0001271901760183.
 H. Abolhassani, B. Bagheri Hariri and S. H. Haeri, ‘A New Structural Measure Based on Graphs of Ontologies’, 2006, Scientia Iranica, http://www.scientiairanica.com.
 H. Abolhassani, S. H. Haeri and B. Bagheri Hariri, ‘On Ontology Alignment Experiments’, Webology, vol. 3, no. 3, 2006.
 S. H. Haeri, B. Bagheri Hariri and H. Abolhassani, ‘Coincidence-Based Refinement of Ontology Matching’, in Joint 3rd SCIS and 7th ISIS, Tokyo, Japan, Sep. 2006, pp. 1008–1013. doi: 10.14864/softscis.2006.0.1008.0.
- Formalisation of the ΔQ Systems Development Paradigm: In this paradigm, performance is a first-class citizen throughout the entire SDLC. ΔQ values are improper random variables (described by their CDFs) that represent quality attenuation. This research is funded by IOHK and is in close collaboration with PNSol.
- Co-Evolution of Programming Languages (Co-Evo): A programming language can mean many different things to its users: a formal semantics, compiler toolchain (lexer, type checker, interpreter, etc.), its IDE, analysis tools (static analaysis, memory footprinting, etc.), and more. Co-Evo collectively studies the co-evolution of those altogether. This project is funded by the Research Council of Norway and is hosted by UiB.
I am always interested in supervising theses on topics that fall in my research interests. Please do not hesitate to get in contact if you have a topic in mind or would like to know of those I already have. N.B. The matter of funding comes separately.