Sciweavers

3323 search results - page 16 / 665
» Computational Semantics with Functional Programming
Sort
View
ESOP
2009
Springer
15 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
TLCA
2007
Springer
15 years 3 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani
ICFP
2001
ACM
15 years 9 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
TYPES
2004
Springer
15 years 3 months ago
Tactic-Based Optimized Compilation of Functional Programs
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...
Thomas Meyer, Burkhart Wolff