See this document in CiteSeerX!

Logical and Computational Aspects of Programming with Sets/Bags/Lists (1991)  (Make Corrections)  (10 citations)
Val Breazu-Tannen, Ramesh Subrahmanyam
Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP'91)



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
upenn.edu/pub/papers/...icalp91rev.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  upenn.edu/~db/langs...8992papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . We study issues that arise in programming with primitive recursion over non-free datatypes such as lists, bags and sets. Programs written in this style can lack a meaning in the sense that their outputs may be sensitive to the choice of input expression. We are, thus, naturally lead to a set-theoretic denotational semantics with partial functions. We set up a logic for reasoning about the definedness of terms and a deterministic and terminating evaluator. The logic is shown to be sound in the ... (Update)

Context of citations to this paper:   More

.... types, such as the complex objects (nested sets) Jac82, AB87, KV84, KRS85, AG91] the bags (sets with duplicates) BK90, Mum90, Alb91, BS91, GM93, LW94] the lists (internal order) the ordered sets, and the pomsets (partially ordered multisets) Pra84] 2.1 Partially...

...very useful. See, for example [2, 3, 18, 22, 26, 27] Moreover, there are theoretical foundations for studying such languages [4, 11]. Functional languages have certain advantages over logical languages for complex objects. They have clear syntax (there is no need, for...

Cited by:   More
Constraint Object-Oriented Database System - Victor (1996)   (Correct)
Verifiable Properties of Database Transactions - Benedikt, Griffin, al. (1998)   (Correct)
UnQL: A Query Language and Algebra for Semistructured.. - Buneman, Fernandez.. (2000)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Semantic Domains - Gunter, Scott (1990)   (Correct)
0.1:   New Foundations for the Geometry of Interaction - Abramsky, Jagadeesan (1993)   (Correct)
0.1:   HasCASL: Towards Integrated Specification and Development.. - Schröder, Mossakowski (2002)   (Correct)

Similar documents based on text:   More   All
0.2:   First-Order Unification by Structural Recursion - Conor Mcbride Department (2001)   (Correct)
0.2:   Query Languages for Bags - Libkin, Wong (1993)   (Correct)
0.1:   PRO-ART: Enabling Requirements Pre-Traceability - Pohl (1996)   (Correct)

Related documents from co-citation:   More   All
7:   Structural Recursion as a Query Language - Breazu-Tannen, Buneman et al. - 1991
5:   Naturally embedded query languages (context) - Breazu-Tannen, Buneman et al. - 1992
4:   Algebraic optimization of object oriented query languages (context) - Beeri, Kornatzky - 1990

BibTeX entry:   (Update)

V. Breazu-Tannen and R. Subrahmanyam. Logical and computational aspects of programming with sets/bags/lists. In Automata, Languages and Programming: 18 th International Colloquium, Lecture Notes in Computer Science, pages 60--75. Springer-Verlag, 1991. http://citeseer.ist.psu.edu/breazu-tannen91logical.html   More

@inproceedings{ breazutannen91logical,
    author = "V. {Breazu-Tannen} and R. Subrahmanyan",
    title = "Logical and computational aspects of programming with sets/bags/lists",
    booktitle = "Proceedings of the 18th International Colloquium on Automata, Languages and Programming ({ICALP}'91)",
    volume = "510",
    publisher = "Springer-Verlag",
    editor = "A. Leach and Burkhard Monien and Mario Rodríguez-Artalejo",
    pages = "60--71",
    year = "1991",
    url = "citeseer.ist.psu.edu/breazu-tannen91logical.html" }
Citations (may not include all citations):
729   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
333   Introduction to Functional Programming (context) - Bird, Wadler - 1988  ACM
273   Can Programming Be Liberated From the von Neumann Style (context) - Backus - 1978
268   Proofs and Types (context) - Girard, Lafont et al. - 1989  ACM
197   A Relational Model for Large Shared Databank (context) - Codd - 1970
121   Types and Persistence in Database Programming Languages (context) - Atkinson - 1987  ACM   DBLP
90   Structural Recursion as a Query Language - Breazu-Tannen, Buneman et al. - 1991  ACM   DBLP
66   Views: A Way for Pattern Matching to Cohabit with Data Abstr.. - Wadler - 1987  ACM   DBLP
63   Database Programming in Machiavelli - a Polymorphic language.. - Ohori, Buneman et al. - 1989  DBLP
59   Using Powerdomains to Generalize Relational Databases - Buneman, Jung et al. - 1989  ACM   DBLP
48   Some High-Level Language Constructs for Data of Type Relatio.. (context) - Schmidt - 1977  ACM
8   Categories of Partial Morphisms and the p -calculus (context) - Moggi - 1985
2   Sets and the Semantics of Bounded Non-Determinism (context) - Gunter - 1986
1   Programming with Sets: An Itroduction to SETL (context) - Schwartz, Dewar et al. - 1986



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://linc.cis.upenn.edu/~db/langs/89-92papers.html):   More
Structural Recursion as a Query Language - Breazu-Tannen, Buneman, Naqvi (1991)   (Correct)
A Type System that Reconciles Classes and Extents - Buneman, Ohori (1991)   (Correct)
Database Programming in Machiavelli - a Polymorphic.. - Ohori, Buneman.. (1992)   (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