Marc A. Bezem  Home/Search
Context Related
| cwi.nl/ftp/CWIreports/...PNAR9907.ps.Z 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: cwi.nl/static/publicat...PNA1999 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We set up a framework for the study of extensionality in the context of higher-order logic programming. For simply typed logic programs we propose a novel declarative semantics, consisting of a model class with a semicomputable initial model, and a notion of extensionality. We show that the initial model of a simply typed logic program, in case the program is extensional, collapses into a simple, set-theoretic representation. Given the undecidability of extensionality in general, we develop a... (Update)
Cited by: More
Extensional Higher-Order Datalog - Kountouriotis, Rondogiannis, Wadge (Correct)
Active bibliography (related documents): More All
0.2: Higher-Order Logic Programming - Nadathur, Miller (1986) (Correct)
0.2: On the Parallel Implementation of the Higher-Order Logic.. - Arcelli, Formato (Correct)
0.2: Higher-Order, Linear, Concurrent Constraint Programming - Saraswat, Lincoln (1992) (Correct)
Similar documents based on text: More All
0.4: Uniform Convergence of Curve Estimators for Ergodic Diffusion.. - van Zanten (2000) (Correct)
0.3: Formulas as Programs - Apt, Bezem (1998) (Correct)
0.3: Metrics for Classifying Heterogeneous Objects - Bezem, Blok, Keijzer (1998) (Correct)
BibTeX entry: (Update)
M. Bezem. Extensionality of Simply Typed Logic Programs. In International Conference on Logic Programming (ICLP), pages 395--410, 1999. http://citeseer.ist.psu.edu/bezem99extensionality.html More
@inproceedings{ bezem99extensionality,
author = "Marc Bezem",
title = "Extensionality of Simply Typed Logic Programs",
booktitle = "International Conference on Logic Programming",
pages = "395-410",
year = "1999",
url = "citeseer.ist.psu.edu/bezem99extensionality.html" }
Citations (may not include all citations):419 A formulation of the simple theory of types (context) - Church - 1940
192 Logic programming (context) - Apt - 1990
179 The Godel Programming Language (context) - Hill, Lloyd - 1994
160 The principal type-scheme of an object in combinatory logic (context) - Hindley - 1969
104 Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Troelstra - 1973
101 Higher-order logic programming - Nadathur, Miller - 1998
101 Hilog: a foundation for higher-order logic programming - Chen, Kifer et al. - 1993
86 Completeness in the theory of types (context) - Henkin - 1950
46 Types in Logic Programming (context) - Pfenning - 1992
30 Basic simple type theory (context) - Hindley - 1997
26 cient purely declarative logic programming language (context) - Somogyi, Henderson et al. - 1996
5 Higher-order Horn logic programming (context) - Wadge - 1991
Documents on the same site (http://www.cwi.nl/static/publications/reports/PNA-1999.html): More
Statistical Estimation of Poisson Intensity Functions - Helmers, Mangku (1999) (Correct)
Consistent Estimation of the Intensity Function of a.. - Helmers, Mangku, Zitikis (1999) (Correct)
Markov Chain Conditions for Admissibility in Estimation Problems.. - Eaton (1999) (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