Sciweavers

5090 search results - page 583 / 1018
» Constructing Strategies for Programming
Sort
View
FOSSACS
2003
Springer
16 years 2 days ago
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
Andreas Abel, Ralph Matthes, Tarmo Uustalu
LICS
2002
IEEE
15 years 11 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
ICFP
1998
ACM
15 years 11 months ago
Intensional Polymorphism in Type-Erasure Semantics
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
Karl Crary, Stephanie Weirich, J. Gregory Morriset...
IFIP
1998
Springer
15 years 11 months ago
Providing Reliable Agents for Electronic Commerce
It is widely agreed that mobile agents in conjunction with WWW technology will provide the technical foundation for future electronic commerce. A prerequisite for the use of mobile...
Markus Straßer, Kurt Rothermel, Christian Ma...
ICFP
1997
ACM
15 years 11 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary