Enhanced type inference for binding-time analysis-Reference-Cited by-同舟云学术

Enhanced type inference for binding-time analysis

Published:2020-12-01 Issue:2 Volume:12 Page:232-250
ISSN:2066-7760
Container-title:Acta Universitatis Sapientiae, Informatica
language:en
Short-container-title:

Author:

Szokoli Mátyás¹,Kiss Attila²

Affiliation:

1. Eötvös Loránd University , Budapest , Hungary

2. J. Selye University , Komárno , Slovakia

Abstract

Abstract In this paper we will be taking a look at type inference and its uses for binding-time analysis, dynamic typing and better error messages. We will propose a new binding-time analysis algorithm ℬ, which is a modification of an already existing algorithm by Gomard [4], and discuss the speed difference.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/ausi-2020-0014

Reference16 articles.

1. [1] K. Asai, Toward introducing binding-time analysis to MetaOCaml, Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, St. Petersburg, FL, USA, 2016, pp. 97–102. ⇒23310.1145/2847538.2847547

2. [2] K. Claessen, J. Hughes, Quickcheck: A lightweight tool for random testing of Haskell programs, SIGPLAN35, 9 (2000) 268—279. ⇒24510.1145/357766.351266

3. [3] C. Gomard, N. Jones, A partial evaluator for the untyped lambda calculus, Journal of Functional Programming1, 1 (1991) 21–69. ⇒23310.1017/S0956796800000058

4. [4] C. K. Gomard, Partial type inference for untyped functional programs, Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice, France, 1990, pp. 282–287. ⇒232, 234, 23510.1145/91556.91672

5. [5] F. Henglein, Efficient type inference for higher-order binding-time analysis, Conference on Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science523 (1991) 448—472. ⇒24810.1007/3540543961_22