D.A.Turner: Miranda: A non-strict functional language with polymorphic types, Proc. ACM Conf. on Functional Languages and Computer Architecture 1985, LNCS 201, Springer Verlag 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graph-based Implementation of a Functional Logic Language - Kuchen, Loogen.. (1990) (21 citations) Self-citation (Functional Proc) (Correct)
....0 and s (successor function) and the usual arithmetic functions. A special primitive function symbol is the strong equality symbol = with type ff ff bool whose definition will be given later. In example programs we declare constructed types and data constructors in a MIRANDA like style, cfr. Turner 85] We distinguish the following syntactic domains: ffl variables ranged over by X, Y, Z : 2 Var, ffl terms ranged over by s, t, 2 Term Sigma : t : X variable j c c=0 2 DC Sigma , constant j c(t 1 ; t n ) c=n 2 DC Sigma , construction, ffl expressions ranged over ....
D.A.Turner: Miranda: A non-strict functional language with polymorphic types, Proc. ACM Conf. on Functional Languages and Computer Architecture 1985, LNCS 201, Springer Verlag 1985.
A Debugging Model for Lazy Functional Logic Languages - Arenas-Sanchez, Gil-Luezas (1994) Self-citation (Functional) (Correct)
.... [KLMR90a] MR92] which includes a type system with parametric polymorfism in the style of ML [Mil78] DM82] facilities to define high order functions using currification and partial application in order to achieve higher order programming without using Gamma abstractions in the line of Miranda [Tur85]. Let DC;DF be a signature with the ranked alphabet DC = S n2N DC n of data constructor symbols, and the disjoint ranked alphabet DF = S n2N DF n of function symbols. The following syntactic domains are distinguished: ffl Variables X;Y; Z 2 Var ffl Terms s; t; 2 Term : t : X ....
D.A. Turner: Miranda: A non-strict functional language with polymorphic types, ACM Conf. on Functional Languages and Computer Architecture 1985, LNCS 201, Springer 1985, pp. 1--16.
A Debugging Model for Lazy Functional Logic Languages - Puri Arenas-S'anchez (1994) Self-citation (Functional) (Correct)
.... Babel [15] 22] which includes a type system with parametric polymorphism in the style of ML [21] 7] facilities to define higher order functions using curryfication and partial application in order to achieve higher order programming without using Gammaabstractions in the line of Miranda [26]. Let DC;DF be a signature with the ranked alphabet DC = S n2N DC n of data constructor symbols, and the disjoint ranked alphabet DF = S n2N DF n of function symbols. The following syntactic domains are distinguished: ffl Variables X;Y; Z 2 Var ffl Terms s; t; 2 Term : t : X ....
D.A. Turner: Miranda: A non-strict functional language with polymorphic types, ACM Conf. on Functional Languages and Computer Architecture 1985, LNCS 201, Springer 1985, pp. 1--16.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC