(Enter summary)
Abstract: : We consider the following problem in proving
observational congruences in functional languages:
given a call-by-name language based on the simplytyped
-calculus with algebraic operations axiomatized
by algebraic equations E, is the set of observational
congruences between terms exactly those provable from
(fi), (j), and E? We find conditions for determining
whether fijE-equational reasoning is complete for
proving the observational congruences between such
terms. We demonstrate the power and ... (Update)
Context of citations to this paper: More
...to show that an extension of C for C 0 ; F 2 based on c and p is faithful. In an upcoming paper, Riecke and Subrahmanyam [24] prove an extension of Statman s 1 Section Theorem to mixtures of and first order algebras. Based on their central theorem [24:Thm. 11] it...
Cited by: More
SPCF: Its Model, Calculus, and Computational Power.. - Kanneganti.. (1992)
(Correct)
Similar documents (at the sentence level):
12.4%: Conditions for the Completeness of Functional and.. - Riecke, Subrahmanyam (1997)
(Correct)
Active bibliography (related documents): More All
0.4: LCF Should Be Lifted - Bloom, Riecke (1988)
(Correct)
0.2: Hereditarily Sequential Functionals - Nickau (1994)
(Correct)
0.1: A Fully Abstract Semantics for a Nondeterministic Functional.. - Jeffrey (1995)
(Correct)
Similar documents based on text: More All
0.4: Short Proofs of Normalization for the simply-typed.. - Joachimski, Matthes (1999)
(Correct)
0.2: On a Conjecture of Erdös - Gold, Tucker (1994)
(Correct)
0.2: Complementary Sets Of Systems Of Congruences - Gold, Tucker (1993)
(Correct)
BibTeX entry: (Update)
Riecke, J. and R. Subrahmanyam. Algebraic reasoning and completeness in typed languages. In Proc. 20th ACM Symposium on Principles of Programming Languages, 1992, to appear. http://citeseer.ist.psu.edu/riecke92algebraic.html More
@inproceedings{ riecke93algebraic,
author = "Jon G. Riecke and Ramesh Subrahmanyam",
title = "Algebraic Reasoning and Completeness in Typed Languages",
booktitle = "Conference record of the Twentieth Annual {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages, Charleston, South Carolina",
pages = "185--195",
year = "1993",
url = "citeseer.ist.psu.edu/riecke92algebraic.html" }
Citations (may not include all citations):
306
LCF considered as a programming language (context) - Plotkin - 1977
179
The lazy lambda calculus
- Abramsky - 1990
63
Semantics with Applications: A Formal Introduction (context) - Nielson, Nielson - 1992
55
Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
41
Equality between functionals (context) - Friedman - 1975
31
What is a model of the lambda calculus (context) - Meyer - 1982
25
A type theoretical alternative to CUCH (context) - Scott - 1969
18
Fully abstract models of the typed lambda calculus (context) - Milner - 1977
10
The Logic and Expressibility of Simply-Typed Call-by-Value a..
- Riecke - 1991
10
Modular higherorder E-unification (context) - Nipkow, Qian - 1991
8
Computing with recursive types (context) - Cosmadakis - 1989
6
The Lazy Lambda Calculus: An Investigation into the Foundati.. (context) - Ong - 1988
5
Scott's LCF language (context) - Yu, of et al. - 1976
3
invariance and lambda-definability (context) - Statman - 1982
1
Submitted for publication to Information and Computation (context) - Riecke, -section et al. - 1992
Documents on the same site (http://www.ampl.com/who/riecke/bib.html): More
The SLam Calculus: Programming with Secrecy and Integrity - Heintze, Riecke (1998)
(Correct)
Semantic Orthogonality of Type Disciplines - Riecke, Subrahmanyam (1997)
(Correct)
Conditions for the Completeness of Functional and.. - Riecke, Subrahmanyam (1997)
(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