RTA 2010 - PDF Preprint Papers

RTA 2010 International Conference on Rewriting Techniques and Applications

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed RTA-2010 Paper

click to vote

RTA
2010
Springer

210views Theoretical Computer Science» more RTA 2010»

Simulation in the Call-by-Need Lambda-Calculus with letrec

13 years 8 months ago

Download www.ki.informatik.uni-frankfurt.de

This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...

Manfred Schmidt-Schauß, David Sabel, Elena M...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	210	Simulation in the Call-by-Need Lambda-Calculus with letrec	claim
2	204	Automated Termination Analysis of Java Bytecode by Term Rewriting	claim
3	178	Automata for Data Words and Data Trees	claim
4	178	Closing the Gap Between Runtime Complexity and Polytime Computability	claim
5	175	Declarative Debugging of Missing Answers for Maude	claim
6	169	Computing Critical Pairs in 2-Dimensional Rewriting Systems	claim
7	161	Certified Subterm Criterion and Certified Usable Rules	claim
8	157	A Proof Calculus Which Reduces Syntactic Bureaucracy	claim
9	156	Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling	claim
10	148	Underspecified computation of normal forms	claim
11	146	Proving Productivity in Infinite Data Structures	claim
12	142	Infinitary Rewriting: Foundations Revisited	claim
13	141	Higher-Order (Non-)Modularity	claim
14	140	Modular Complexity Analysis via Relative Complexity	claim
15	139	Order-Sorted Unification with Regular Expression Sorts	claim
16	137	Abstract Models of Transfinite Reductions	claim
17	133	Termination of linear bounded term rewriting systems	claim
18	132	On (Un)Soundness of Unravelings	claim
19	130	A Rewriting Logic Semantics Approach to Modular Program Analysis	claim
20	128	Polynomially Bounded Matrix Interpretations	claim
21	128	Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers	claim
22	126	Optimizing mkbTT	claim
23	114	An Efficient Nominal Unification Algorithm	claim
24	91	The Undecidability of Type Related Problems in Type-free Style System F	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers