Tarmo Uustalu  Home/Search
Context Related
| it.kth.se/labs/se/Repo...sspaspl.ps.Z it.kth.se/Reports/...TRITAIT9508.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: it.kth.se/labs/cs/segroup...publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This report is an attempt to describe the location of structural synthesis of programs (SSP) in the landscape of different methods of programming in logic by elucidating its relationship to other methods. After a short survey of the essentials of different methods of programming in logic, we present a brief description of the main ideas of SSP, and then show how SSP relates to these methods. The main claim of the report is that SSP is describable as logic meta-programming. ii SSP as... (Update)
Context of citations to this paper: More
...is computation , logic programming is identi ed as formulae are programs, proof search is computation . As it is clearly determined in [94] SSP can be seen as a mixture of logic and functional programming and can be de ned as logic meta programming. From the logic...
Cited by: More
Linear Logic Programming for AI Planning - Küngas (2002) (Correct)
Active bibliography (related documents): More All
0.2: Categorical Structure of Continuation Passing Style - Thielecke (1997) (Correct)
0.2: Classical linear natural deduction and the linear.. - Maraist (1999) (Correct)
0.2: A de Bruijn notation for higher-order rewriting - Bonelli, Kesner, Ríos (2000) (Correct)
Similar documents based on text: More All
0.4: A Fast Approximation Algorithm - For The Subset-Sum (Correct)
0.4: Extensions of Structural Synthesis of Programs - Tarmo Uustalu (1994) (Correct)
0.4: Primitive (Co)Recursion and Course-of-Value (Co)Iteration.. - Uustalu, Vene (1999) (Correct)
BibTeX entry: (Update)
T. Uustalu. Structural synthesis of programs as programming in logic. Technical Report TRITA-IT R 95:08, Department of Teleinformatics, Royal Institute of Technology, Stockholm, March 1995. http://citeseer.ist.psu.edu/uustalu95structural.html More
@techreport{ uustalu95structural,
author = "Tarmo Uustalu",
title = "Structural Synthesis of Programs as Programming in Logic",
number = "TRITA-IT R 95:08",
year = "1995",
url = "citeseer.ist.psu.edu/uustalu95structural.html" }
Citations (may not include all citations):382 Lambda calculi with types - Barendregt - 1992
343 Introduction to Metamathematics (context) - Kleene - 1952
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
266 Information and Computation (context) - Coquand, Huet et al. - 1988
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1991
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
233 Computational interpretations of linear logic - Abramsky - 1993
233 The formulae-as-types notion of construction (context) - Howard - 1980
159 The chemical abstract machine (context) - Berry, Boudol - 1990
134 calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
110 The formulae-as-types notion of control - Griffin - 1990
109 Programming in Martin-Lof's Type Theory (context) - Nordstrom, Petersson et al. - 1990
101 Higher-order logic programming - Miller, Nadathur - 1986
60 A term calculus for intuitionistic linear logic - Benton, Bierman et al. - 1993
51 Operational aspects of linear lambda calculus - Lincoln, Mitchell - 1992
47 volume 7 of Cambridge tracts in Theoretical Computer Science (context) - Girard, Taylor et al. - 1989
41 An evaluation semantics for classical proofs (context) - Murthy - 1991
34 Intuitionism: An Introduction (context) - Heyting - 1971
22 Three new-generation software environments (context) - Tyugu - 1991
20 Logic programming with focusing proofs in linear logic (context) - Andreoli - 1992
18 A proof procedure for the logic of hereditary Harrop formula.. - Nadathur - 1993
17 Justification of the structural synthesis of programs (context) - Mints, Tyugu - 1982
16 MOLOG: A system that extends PROLOG with modal logic (context) - nas, Cerro - 1986
8 Propositional logic programming (context) - Mints - 1991
6 A proof-theoretic concept of tautological hardness (context) - Stalmarck - 1994
5 Algorithms of structured synthesis of programs (context) - Tyugu, Harf - 1980
4 Delta -calculus (context) - Rehof, Sorensen - 1994
1 Complexity of subclasses of the intuitionistic propositional.. (context) - Mints - 1992
1 Efficient program synthesis: Semantics (context) - Kanovich - 1991
Documents on the same site (http://www.it.kth.se/labs/cs/se-group/publ.html): More
Using Classes As Specifications For Automatic Construction Of.. - Tyugu (1994) (Correct)
Program Analysis and Visualisation: Towards A Declarative.. - Sidarkeviciute (1997) (Correct)
Constraints in NUT - Penjam, Tyugu (1994) (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