메뉴 건너뛰기




Volumn 844 LNCS, Issue , 1994, Pages 385-399

Combining lazy narrowing with disequality constraints

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; PROLOG (PROGRAMMING LANGUAGE); SEMANTICS;

EID: 84969400315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58402-1_27     Document Type: Conference Paper
Times cited : (20)

References (22)
  • 1
    • 85020785334 scopus 로고    scopus 로고
    • Compiling lazy narrowing into Prolog, Technical Report 25, LIENS, 1990
    • P.H. Cheong: Compiling lazy narrowing into Prolog, Technical Report 25, LIENS, 1990, to appear in: Journal of New Generation Computing.
    • Journal of New Generation Computing
    • Cheong, P.H.1
  • 2
    • 0007251325 scopus 로고
    • Prolog and infinite trees
    • K.L. Clark, S.A. Tarnlund (eds.), Academic Press
    • A. Colmerauer: Prolog and infinite trees, in K.L. Clark, S.A. Tarnlund (eds.) Logic Programming, Academic Press, 1982, 231-251.
    • (1982) Logic Programming , pp. 231-251
    • Colmerauer, A.1
  • 3
    • 0021655624 scopus 로고
    • Equations and inequations on finite and infinite trees
    • A. Colmerauer: Equations and inequations on finite and infinite trees, Procs. FGCS’84, 1984, 85-99.
    • (1984) Procs. FGCS’84 , pp. 85-99
    • Colmerauer, A.1
  • 4
  • 8
    • 84955607377 scopus 로고
    • The Integration of Functions into Logic: From Theory to Practice
    • Also available as Tech. Rep. MPI-I-94,201
    • M. Hanus: The Integration of Functions into Logic: From Theory to Practice, to appear in J of Logic Progr. Also available as Tech. Rep. MPI-I-94,201, 1994.
    • (1994) J of Logic Progr
    • Hanus, M.1
  • 12
    • 0002692684 scopus 로고
    • Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification
    • J.L.Lassez,G. Plotkin (eds), The MIT Press
    • J.P. Jouannaud, C. Kirchner: Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification, in: J.L.Lassez,G. Plotkin (eds.) Computational Logic, Essays in Honor of Alan Robinson, The MIT Press, 1991,357-321.
    • (1991) Computational Logic, Essays in Honor of Alan Robinson , pp. 321-357
    • Jouannaud, J.P.1    Kirchner, C.2
  • 16
    • 85020809634 scopus 로고
    • A General Scheme for Constraint Functional Logic Programming
    • LNCS
    • F.J. López-Fraguas: A General Scheme for Constraint Functional Logic Programming, Procs. ALP, LNCS 632, 1992, 213-217.
    • (1992) Procs. ALP , vol.632 , pp. 213-217
    • López-Fraguas, F.J.1
  • 17
    • 0024126962 scopus 로고
    • Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees
    • M. Maher: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees, Procs. 3rd IEEE Symp. Logic in Computer Science, 1988, 348-357.
    • (1988) Procs. 3Rd IEEE Symp. Logic in Computer Science , pp. 348-357
    • Maher, M.1
  • 19
    • 0000406692 scopus 로고
    • Logic Programming with Functions and Predicates: The Language BABEL
    • J.J. Moreno-Navarro, M. Rodríguez-Artalejo: Logic Programming with Functions and Predicates: The Language BABEL, J. Logic Programming, 12, 1992, 189-223.
    • (1992) J. Logic Programming , vol.12 , pp. 189-223
    • Moreno-Navarro, J.J.1    Rodríguez-Artalejo, M.2
  • 20
    • 0022213996 scopus 로고
    • Narrowing as the Operational Semantics of Functional Languages
    • U.S. Reddy: Narrowing as the Operational Semantics of Functional Languages, Procs. Int. Symp on Logic Programming, 1985, 138-151.
    • (1985) Procs. Int. Symp on Logic Programming , pp. 138-151
    • Reddy, U.S.1
  • 21
    • 85037056865 scopus 로고
    • Domains for Denotational Semantics
    • D.S. Scott: Domains for Denotational Semantics, Procs. ICALP, LNCS 140,1892, 577-613.
    • (1892) Procs. ICALP, LNCS , vol.140 , pp. 577-613
    • Scott, D.S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.