ENTCS 2000 - PDF Preprint Papers

ENTCS 2000

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENTCS-2000 Paper

click to vote

ENTCS
2000

154views more ENTCS 2000»

Debugging Haskell by Observing Intermediate Data Structures

13 years 10 months ago

Download www.ittc.ku.edu

Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...

Andy Gill

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	154	Debugging Haskell by Observing Intermediate Data Structures	claim
2	123	Defining Standard Prolog in Rewriting Logic	claim
3	120	Efficient Substitution in Hoare Logic Expressions	claim
4	114	Syntactic Type Soundness for the Region Calculus	claim
5	112	Typed Multiset Rewriting Specifications of Security Protocols	claim
6	109	Forward and Backward Chaining in Linear Logic	claim
7	103	Combinator Parsers - From Toys to Tools	claim
8	97	Complexity of Weak Bisimilarity and Regularity for BPA and BPP	claim
9	88	Notes on Coalgebras, Cofibrations and Concurrency	claim
10	83	Typed Logical Variables in Haskell	claim
11	82	Abstract Interpretation Based Verification of Logic Programs	claim
12	81	Secrecy, Group Creation	claim
13	80	The simply typed rewriting calculus	claim
14	80	Behavioral and Coinductive Rewriting	claim
15	74	Categorical Models for Fairness: Completion vs Delay	claim
16	70	A Space Semantics for Core Haskell	claim
17	70	Haskell Server Pages - Functional Programming and the Battle for the Middle Tier	claim
18	69	May Testing, Non-interference, and Compositionality	claim
19	66	Formal topology and domains	claim
20	63	The Leader Election Protocol of IEEE 1394 in Maude	claim
21	60	Incompleteness of Behavioral Logics	claim
22	60	Writing Constructive Proofs Yielding Efficient Extracted Programs	claim
23	59	Building continuous webbed models for system F	claim
24	57	Weightable quasi-metric semigroups and semilattices	claim
25	56	A Distributed Pi-Calculus with Local Areas of Communication	claim
26	55	A graphical approach to monad compositions	claim
27	54	Observation systems	claim
28	52	Developing Theories of Types and Computability via Realizability	claim
29	50	Lambada, Haskell as a Better Java	claim
30	42	Equilogical spaces and domains with totality	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers