-
1
-
-
84957612447
-
Optimal non-deterministic functional logic computations
-
Southampton, UK, Sept, Springer LNCS 1298
-
S. Antoy. Optimal non-deterministic functional logic computations. In Proc, of the 6th Int. Conference on Algebraic and Logic Programming (ALF'97), pages 16-30, Southampton, UK, Sept. 1997. Springer LNCS 1298. 337, 349
-
(1997)
Proc, of the 6Th Int. Conference on Algebraic and Logic Programming (ALF'97)
, pp. 16-30
-
-
Antoy, S.1
-
2
-
-
0001795798
-
Parallel evaluation strategies for functional logic languages
-
Belgium, July, MIT Press
-
S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of the 14th Int. Conference on Logic Programming (ICLF'97), pages 138-152, Leuven, Belgium, July 1997. MIT Press. 349
-
(1997)
In Proc. of the 14Th Int. Conference on Logic Programming (ICLF'97)
, pp. 138-152
-
-
Antoy, S.1
Echahed, R.2
Hanus, M.3
-
5
-
-
18144388050
-
A correctness proof for Warren's HO into FO translation
-
Gizzeria Lido, IT, Oct
-
J.C. Gonzalez-Moreno. A correctness proof for Warren's HO into FO translation. In Proc. GULF' 93, pages 569-585, Gizzeria Lido, IT, Oct. 1993. 336, 336, 337, 337, 342, 343, 348, 348, 348, 348, 348
-
(1993)
Proc. GULF' 93
, pp. 569-585
-
-
Gonzalez-Moreno, J.C.1
-
6
-
-
84957609496
-
Higher-order narrowing with definitional trees
-
Springer LNCS 1103
-
M. Hanus and C. Prehofer. Higher-order narrowing with definitional trees. In Proc. 7th International Conference on Rewriting Techniques and Applications (RTA '96), pages 138-152. Springer LNCS 1103, 1996. 337, 337, 339, 349, 350, 350, 350, 350, 350, 350, 350
-
(1996)
Proc. 7Th International Conference on Rewriting Techniques and Applications (RTA '96)
, pp. 138-152
-
-
Hanus, M.1
Prehofer, C.2
-
7
-
-
33745446515
-
Polymorphic higher-order programming in prolog
-
MIT Press, June
-
Michael Hanus. Polymorphic higher-order programming in prolog. In Proc. 6th International Conference on Logic Frogramming, pages 382-397. MIT Press, June 1989. 336, 346
-
(1989)
Proc. 6Th International Conference on Logic Frogramming
, pp. 382-397
-
-
Hanus, M.1
-
9
-
-
0000968273
-
A logic programming language with lambda-abstraction, function variables, and simple unification
-
D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991. 337, 350
-
(1991)
Journal of Logic and Computation
, vol.1
, Issue.4
, pp. 497-536
-
-
Miller, D.1
-
10
-
-
84958648951
-
A complete narrowing calculus for higher-order functional logic programming
-
Springer LNCS 982
-
K. Nakahara, A. Middeldorp, and T. Ida. A complete narrowing calculus for higher-order functional logic programming. In Proc. 7th International Symposium on Frogramming Languages, Implementations, Logics and Frograms (FLILF'95), pages 97-114. Springer LNCS 982, 1995. 336, 337, 339, 341, 349, 349, 350, 350
-
(1995)
Proc. 7Th International Symposium on Frogramming Languages, Implementations, Logics and Frograms (FLILF'95)
, pp. 97-114
-
-
Nakahara, K.1
Middeldorp, A.2
Ida, T.3
-
11
-
-
85035001592
-
Definitional interpreters for higher-order programming languages
-
ACM
-
J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM National Conference, pages 717-740. ACM, 1972. 336, 337
-
(1972)
ACM National Conference
, pp. 717-740
-
-
Reynolds, J.C.1
-
12
-
-
0032281046
-
From ML to Ada: Strongly-typed language interoperability via source translation
-
July
-
A. Tolmach and D. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Frogramming, 8(4):367-412, July 1998. 337, 337, 346
-
(1998)
Journal of Functional Frogramming
, vol.8
, Issue.4
, pp. 367-412
-
-
Tolmach, A.1
Oliva, D.2
-
14
-
-
85042810898
-
-
June, Boston College Computer Science Technical Report BCCS-97-03
-
Proc. Workshop on Types in Compilation (TIC97), June 1997. Boston College Computer Science Technical Report BCCS-97-03. 336
-
(1997)
Proc. Workshop on Types in Compilation (TIC97)
-
-
|