Type Inference for Bimorphic Recursion
This paper proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic recursion allows us to assign two different types to a recursively defined function: one is for its recursive calls and...
Main Authors: | Makoto Tatsuta, Ferruccio Damiani |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2011-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1106.1234v1 |
Similar Items
-
Piezoelectric bimorph MEMS speakers
by: Yiming Lang, et al.
Published: (2022-09-01) -
Electrothermally-Actuated Micromirrors with Bimorph Actuators—Bending-Type and Torsion-Type
by: Cheng-Hua Tsai, et al.
Published: (2015-06-01) -
INVESTIGATION OF CHARACTERISTICS OF BIMORPH PIEZOELECTRIC TRANSDUCERS
by: Костянтин Вікторович Базіло
Published: (2019-10-01) -
MATHEMATICAL DESCRIPTION OF BIMORPH PIEZOELECTRIC ELEMENT
by: Олег Миколайович Петрищев, et al.
Published: (2019-04-01) -
CONSTRUCTION OF MATHEMATICAL MODEL OF BIMORPH PIEZOELECTRIC TRANSFORMER
by: Олег Миколайович Петрищев, et al.
Published: (2019-10-01)