-
1
-
-
0004891781
-
Compiling Pattern Matching
-
LNCS 201
-
L. AUGUSTSSON, Compiling Pattern Matching, FPCA '85, LNCS 201.
-
FPCA '85
-
-
Augustsson, L.1
-
2
-
-
85029796027
-
Complexity of Trie Index Construction
-
D. COMER and R. SETHI, Complexity of Trie Index Construction, FOGS '76.
-
FOGS '76
-
-
Comer, D.1
Sethi, R.2
-
3
-
-
84919225394
-
Fast Knuth-Bendix Completion: Summary
-
LNCS 355
-
J. CHRISTIAN, Fast Knuth-Bendix Completion: Summary, RTA '89, LNCS 355.
-
RTA '89
-
-
Christian, J.1
-
4
-
-
26544474481
-
Left-to-Right Tree Pattern Matching
-
A. GRAF, Left-to-Right Tree Pattern Matching, RTA '91, LNCS 488.
-
RTA '91, LNCS 488
-
-
Graf, A.1
-
5
-
-
17644424889
-
The Definition of Standard ML
-
University of Edinburgh
-
R. HARPER, R. MILNER AND M. TOFTE, The Definition of Standard ML, Report ECS-LFCS-88-62, LFCS, University of Edinburgh, 1988.
-
(1988)
Report ECS-LFCS-88-62, LFCS
-
-
Harper, R.1
Milner, R.2
Tofte, M.3
-
6
-
-
85029819838
-
-
Draft Proposed standard circulated by IFIP WG2.S.
-
P. HUDAK ET AL, Report on Haskell, Draft Proposed standard circulated by IFIP WG2.S., 1988.
-
(1988)
Report on Haskell
-
-
Hudak, P.1
-
7
-
-
5844388509
-
-
Tech. Rep. No. 359, INRIA, Le Chesney, France
-
G. HUET AND J.J. LEVY, Computations in Nonambiguous Linear Term Rewriting Systems, Tech. Rep. No. 359, INRIA, Le Chesney, France, 1979.
-
(1979)
Computations in Nonambiguous Linear Term Rewriting Systems
-
-
Huet, G.1
Levy, J.J.2
-
8
-
-
85029811569
-
Lazy Pattern Matching in the ML Language
-
A. LAVILLE, Lazy Pattern Matching in the ML Language, FST&TCS '87.
-
FST&TCS '87
-
-
Laville, A.1
-
9
-
-
85031927597
-
Implementation of Lazy Pattern Matching Algorithms
-
A. LAVILLE, Implementation of Lazy Pattern Matching Algorithms, ESOP '88, LNCS 300.
-
ESOP '88, LNCS 300
-
-
Laville, A.1
-
10
-
-
85029804881
-
Fast Parallel Implementation of Functional Languages-The EQUALS Experience
-
K. OWEN, S. PAWAGI, C. RAMAKRISHNAN, I.V. RAMAKRISHNAN, R.C. SEKAR, Fast Parallel Implementation of Functional Languages-The EQUALS Experience, to appear in JLFP '92.
-
JLFP '92
-
-
Owen, K.1
Pawagi, S.2
Ramakrishnan, C.3
Ramakrishnan, I.V.4
Sekar, R.C.5
-
11
-
-
0025535993
-
Compiling Pattern Matching by Term Decomposition
-
L. PUEL AND A. SUAREZ, Compiling Pattern Matching by Term Decomposition, LFP '90.
-
LFP '90
-
-
Puel, L.1
Suarez, A.2
-
12
-
-
0024135881
-
Refined Compilation of Pattern Matching for Functional Languages
-
PH. SCHNOEBELEN, Refined Compilation of Pattern Matching for Functional Languages, Science of Computer Programming, 11, pp. 133-159, 1988.
-
(1988)
Science of Computer Programming
, vol.11
, pp. 133-159
-
-
Schnoebelen, P.1
-
13
-
-
85029807903
-
-
TR 14/91, SUNY, Stony Brook
-
R.C. SEKAR, R. RAMGSH AND I.V. RAMAKRISHNAN, Adaptive Pattern Matching, TR 14/91, SUNY, Stony Brook.
-
Adaptive Pattern Matching
-
-
Sekar, R.C.1
Ramgsh, R.2
Ramakrishnan, I.V.3
-
14
-
-
0042094334
-
Efficient Compilation of Pattern Matching
-
S.L. Peyton-Jones, Ed, Prentice Hail International
-
P. WADLER, Efficient Compilation of Pattern Matching, in S.L. Peyton-Jones, Ed, The Implementation of Functional Programming Languages, Prentice Hail International, 1987.
-
(1987)
The Implementation of Functional Programming Languages
-
-
Wadler, P.1
|