Sciweavers

12194 search results - page 220 / 2439
» cans 2010
Sort
View
ENTCS
2007
112views more  ENTCS 2007»
15 years 4 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
ENTCS
2007
120views more  ENTCS 2007»
15 years 4 months ago
A Framework for Interpreting Traces of Functional Logic Computations
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Bernd Braßel
ENTCS
2007
82views more  ENTCS 2007»
15 years 4 months ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers
ENTCS
2007
102views more  ENTCS 2007»
15 years 4 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
ENTCS
2007
101views more  ENTCS 2007»
15 years 4 months ago
Solving Sudoku Puzzles with Rewriting Rules
The aim of the sudoku puzzle (also known as number place in the United States) is to enter a numeral from 1 through 9 in each cell of a grid, most frequently a 9 × 9 grid made up...
Gustavo Santos-García, Miguel Palomino