Sciweavers

5415 search results - page 366 / 1083
» The Implementation of Functional Programming Languages
Sort
View
ENTCS
2008
121views more  ENTCS 2008»
15 years 6 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
ENTCS
2007
123views more  ENTCS 2007»
15 years 6 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
SERA
2009
Springer
16 years 1 months ago
Syntactic and Semantic Prediction in Dynamic Languages
In the context of computer programming, the importance of computer assistance is being understood by many developer communities. Developers are e.g. using the same well known expre...
Jakub Mísek, Filip Zavoral
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
POPL
1997
ACM
15 years 11 months ago
Program Fragments, Linking, and Modularization
Module mechanisms have received considerable theoretical attention, but the associated concepts of separate compilation and linking have not been emphasized. Anomalous module syst...
Luca Cardelli