Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICFP
2012
ACM
10 years 4 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
LPAR
2012
Springer
10 years 9 months ago
Smart Testing of Functional Programs in Isabelle
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
Lukas Bulwahn
PEPM
2011
ACM
11 years 4 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
ENTCS
2002
136views more  ENTCS 2002»
12 years 1 months ago
Comparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
Mauricio Ayala-Rincón, Flávio L. C. ...
IGPL
2000
99views more  IGPL 2000»
12 years 1 months ago
Linear Explicit Substitutions
Abstract Neil Ghani Valeria de Paiva Eike Ritter The -calculus 1 adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implement...
Neil Ghani, Valeria de Paiva, Eike Ritter
TCS
2008
12 years 1 months ago
Lambda calculus with patterns
The -calculus is an extension of the -calculus with a pattern matching facility. The form of the argument of a function can be speci ed and hence -calculus is more convenient than...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
IEICET
2007
110views more  IEICET 2007»
12 years 1 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
CORR
2006
Springer
123views Education» more  CORR 2006»
12 years 1 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
CAV
2006
Springer
146views Hardware» more  CAV 2006»
12 years 5 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
ALP
1992
Springer
12 years 5 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
books