| Type-based nondeterminism checking in functional logic programs |
| Full text |
Pdf
(357 KB)
|
| Source
|
International Conference on Principles and Practice of Declarative Programming
archive
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
table of contents
Montreal, Quebec, Canada
Pages: 202 - 213
Year of Publication: 2000
ISBN:1-58113-265-4
|
|
Authors
|
|
Michael Hanus
|
Institut für Informatik, Christian-Albrechts-Universität Kiel, Olshausenstr. 40, D-24098 Kiel, Germany
|
|
Frank Steiner
|
Institut für Informatik, Christian-Albrechts-Universität Kiel, Olshausenstr. 40, D-24098 Kiel, Germany
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 2, Citation Count: 1
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Sergio Antoy , Rachid Echahed , Michael Hanus, A needed narrowing strategy, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.268-279, January 16-19, 1994, Portland, Oregon, United States
[doi> 10.1145/174675.177899]
|
| |
2
|
L. Cardelli. Type systems. In Allen B. Tucker, Jr. (Editor-in-Chief), The Computer Science and Engineering Handbook. CRC Press, in cooperation with ACM, 1997.
|
 |
3
|
|
 |
4
|
|
| |
5
|
|
| |
6
|
Bart Demoen , María García de la Banda , Warwick Harvey , Kim Marriott , Peter J. Stuckey, Herbrand constraint solving in HAL, Proceedings of the 1999 international conference on Logic programming, p.260-274, November 1999, Las Cruces, New Mexico, United States
|
| |
7
|
|
| |
8
|
|
| |
9
|
M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583{628, 1994.
|
 |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
|
| |
14
|
M. Hanus and R. Sadre. An Abstract Machine for Curry and its Concurrent Implementation in Java. Journal of Functional and Logic Programming, 1999(6).
|
| |
15
|
|
| |
16
|
M. Hanus (ed.). Curry: An integrated functional logic language. Available at http://www.informatik.uni-kiel.de/~curry/, 2000.
|
| |
17
|
M. Hanus, S. Antoy, J. Koj, R. Sadre, and F. Steiner. PAKCS: The Portland Aachen Kiel Curry System. Available at: http://www.informatik.uni-kiel.de/~pakcs/, 2000.
|
| |
18
|
F. Henderson and T. Somogyi, Z. Conway. Determinism analysis in the Mercury compiler. In Proc. of the Nineteenth Australasian Computer Science Conference, pages 337{346, 1996.
|
| |
19
|
|
 |
20
|
|
| |
21
|
|
 |
22
|
|
| |
23
|
|
| |
24
|
H. R. Nielson and F. Nielson. Communication analysis for Concurrent ML. In ML with Concurrency, Monographs in Computer Science, pages 185{235. Springer-Verlag, 1997.
|
| |
25
|
|
 |
26
|
|
| |
27
|
J. Peterson et al. Haskell: A Non-strict, Purely Functional Language (Version 1.4). Technical Report, Yale University, 1997.
|
| |
28
|
|
| |
29
|
P. Van Roy , B. Demoen , Y. D. Willems, Improving the execution speed of compiled prolog with modes, clause selection, and determinism, II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development, p.111-125, March 1987, Pisa, Italy
|
 |
30
|
|
| |
31
|
D.H.D. Warren. Higher-order extensions to PROLOG: are they needed? In Machine Intelligence 10, pp. 441{454, 1982.
|
| |
32
|
|
|