Sciweavers

3323 search results - page 14 / 665
» Computational Semantics with Functional Programming
Sort
View
WCFLP
2005
ACM
15 years 3 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
IWFM
1998
14 years 11 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
100
Voted
ENTCS
2008
110views more  ENTCS 2008»
14 years 9 months ago
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)
ly abstract model for a quantum unctional language (extended abstract) Peter Selinger1 ,2 Dalhousie University, Halifax, Nova Scotia, Canada Beno^it Valiron3 University of Ottawa, ...
Peter Selinger, Benoît Valiron
POPL
2010
ACM
15 years 7 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
73
Voted
BIRTHDAY
2009
Springer
15 years 1 months ago
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantic
Machines Olivier Danvy BRICS Report Series RS-08-7 ISSN 0909-0878 July 2008 08-7O.Danvy:DenotationalSemantics,NaturalSemantics,andAbstractMachinesforScheme
Olivier Danvy