Michael Hanus, Salvador  Home/Search
Context Related
| danae.unimuenster....JFLPA0102.ps.gz informatik.unikiel.de/~...JFLP01.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: danae.unimuenster.de/lehre/ku... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a semantic characterization of narrowing, the computational engine of many functional logic languages. We use a functional domain for giving a denotation to the narrowing space associated to a given initial expression under an arbitrary narrowing strategy. Such a semantic description highlights (and favours) the operational notion of evaluation instead of the more usual model-theoretic notion of interpretation as the basis for the semantic description. The motivation is to... (Update)
Context of citations to this paper: More
...there is no reference to the infinitary term f obtained from f(a) by strongly convergent infinitary rewriting. Closer to ours, in [HL01,Luc00], an observable semantics is given to (computations of) terms without referring its meaning to any external semantic domain. An...
Cited by: More
Transfinite Rewriting Semantics for Term Rewriting Systems - Lucas (2001) (Correct)
Similar documents (at the sentence level):
42.4%: An Evaluation Semantics for Narrowing-Based Functional Logic.. - Hanus, Lucas (2000) (Correct)
31.6%: A Semantics for Program Analysis in Narrowing-Based Functional .. - Hanus, Lucas (1999) (Correct)
Active bibliography (related documents): More All
0.5: The Integration of Functions into Logic Programming: A Survey - Hanus (1994) (Correct)
0.5: A Needed Narrowing Strategy - Antoy, Echahed, Hanus (1994) (Correct)
0.4: A Debugging Scheme for Functional Logic Programs - Alpuente (2002) (Correct)
Similar documents based on text: More All
0.1: Specialization of Functional Logic Programs Based on.. - Alpuente, Hanus.. (1999) (Correct)
0.1: A Parallel Narrowing Strategy - Antoy, Echahed, Hanus (1996) (Correct)
0.1: Strongly Sequential and Inductively Sequential Term.. - Hanus, Lucas, Middeldorp (1998) (Correct)
BibTeX entry: (Update)
M. Hanus and S. Lucas. An Evaluation Semantics for Narrowing-Based Functional Logic Languages. Journal of Functional and Logic Programming, to appear, 2001. http://citeseer.ist.psu.edu/hanus01evaluation.html More
@article{ hanus01evaluation,
author = "Michael Hanus and Salvador Lucas",
title = "An Evaluation Semantics for Narrowing-Based Functional Logic Languages",
journal = "Journal of Functional and Logic Programming",
volume = "2001",
number = "2",
year = "2001",
url = "citeseer.ist.psu.edu/hanus01evaluation.html" }
Citations (may not include all citations):509 Introduction to Lattices and Order (context) - Davey, Priestley - 1990
474 Term Rewriting Systems - Klop - 1992
254 The integration of functions into logic programming: From th.. (context) - Hanus - 1994
214 Domains for Denotational Semantics (context) - Scott - 1982
171 A needed narrowing strategy - Antoy, Echahed et al. - 2000
152 Semantics of Programming Languages (context) - Gunter - 1992
125 Outline of a Mathematical Theory of Computation (context) - Scott - 1970
121 Logic programming with functions and predicates: the languag.. (context) - Moreno-Navarro, Rodr - 1992
112 Initial Algebra Semantics and Continuous Algebras (context) - Goguen, Thatcher et al. - 1977
87 Narrowing as the Operational Semantics of Functional Languag.. (context) - Reddy - 1985
83 Powerdomains and predicate transformers: a topological view (context) - Smyth - 1983
82 ACM Transactions on Programming Languages and Systems (context) - Debray, Warren et al. - 1989
75 Annals of Pure and Applied Logic (context) - Abramsky, in - 1991
73 Topology via Logic (context) - Vickers - 1989
70 A semantics-based framework for the abstract interpretation .. (context) - Jones, ndergaard - 1987
67 Computational semantics of term rewriting systems (context) - Boudol - 1985
61 The theory and practice of transforming call-by-need into ca.. (context) - Mycroft - 1975
48 Operationally-Based Theories of Program Equivalence - Pitts - 1997
45 Call by Need Computations to Root-Stable Form - Middeldorp - 1997
40 Algebraic Properties of Idempotent Substitutions - Palamidessi - 1990
38 Recursive Applicative Program Schemes (context) - Courcelle - 1990
38 Lectures on a mathematical theory of computation (context) - Scott - 1981
36 A Unied Computation Model for Functional and Logic Programmi.. (context) - Hanus - 1997
25 volume 16 of EATCS Monographs on Theoretical Computer Scienc.. (context) - Padawitz, Horn - 1988
21 Mathematical Theory of Domains (context) - Stoltenberg-Hansen, Lindstr et al. - 1994
20 An Initial Algebra Approach to the Specication (context) - Goguen, Thatcher et al. - 1978
18 Canonical forms and unication (context) - Hullot - 1980
15 Functional Dependencies and Moore-Set Completions of Abstrac.. - Giacobazzi, Ranzato - 1995
14 Abstract Rewriting (context) - Bert, Echahed et al. - 1993
13 Independent AND-Parallel Implementation of Narrowing (context) - Kuchen, Moreno-Navarro et al. - 1992
13 Algebraic Semantics (context) - Guessarian - 1981
10 Inverse Image Analysis Generalises Strictness Analysis (context) - Dybjer - 1991
10 An approach to declarative programming based on a rewriting .. (context) - Gonz, Hortal et al. - 1999
10 Information Processing Letters (context) - Lucas, approximations - 1998
10 and Kan Extensions (context) - Abramsky, Logical - 1990
9 Theoretical Computer Science (context) - de Bakker, Points - 1976
9 Intuitionistic Implication in Abstract interpretation (context) - Giacobazzi, Scozzari - 1997
9 A Compositional Semantic Basis for the Analysis of Equationa.. - Alpuente, Falaschi et al. - 1996
8 Denotational Abstract Interpretation of Functional Logic Pro.. (context) - Zartmann - 1997
7 A Fully Abstract Semantics for a First-Order Functional Lang.. (context) - Jagadeesan, Pingali et al. - 1991
6 Semantics-Based Analysis and Transformation of Functional Lo.. (context) - Vidal - 1996
5 Optimization of Equational Logic Programs Using Abstract Nar.. (context) - Alpuente, Falaschi et al. - 1993
5 Automatic Parallelization of Lazy Functional Programs - Hogen, Kindler et al. - 1992
4 Towards the Global Optimization of Functional Logic Programs - Hanus - 1994
3 the Interpretation of Recursive Program Schemes (context) - Nivat - 1975
3 Mode Analysis of Functional Logic Programs (context) - Hanus, Zartmann - 1994
3 Static Analysis of Functional Programs with Logical Variable.. (context) - Lindstrom - 1989
3 Ecient Lazy Narrowing using Demandedness Analysis (context) - Moreno-Navarro, Kuchen et al. - 1993
2 Analyses of Unsatis ability for Equational Logic Programming (context) - Alpuente, Falaschi et al. - 1995
2 the interpretation of Scott's domains (context) - Reynolds - 1975
2 A logical model for relational abstract domains ACM Transact.. (context) - Giacobazzi, Scozzari - 1998
1 Parallelism Identication in BABEL Functional Logic Programs (context) - aenz, Ruz - 1992
Documents on the same site (http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/2001/S01-01/):
Polytypic Programming With Ease - Hinze (2001) (Correct)
Typed Static Analysis: Application to the Groundness Analysis.. - Ridoux, al. (2001) (Correct)
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