Sciweavers

26 search results - page 2 / 6
» A Category-theoretic Account of Program Modules
Sort
View
POPL
1996
ACM
14 years 1 months ago
Using Parameterized Signatures to Express Modular Structure
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
Mark P. Jones
ENTCS
2007
114views more  ENTCS 2007»
13 years 9 months ago
Reporting Failures in Functional Logic Programs
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
Michael Hanus
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
14 years 3 months ago
Time Budgeting in a Wireplanning Context
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...
SCAM
2003
IEEE
14 years 3 months ago
CPP Denotational Semantics
This paper shows that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files a...
Jean-Marie Favre
ICFP
2005
ACM
14 years 9 months ago
Recursive type generativity
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
Derek Dreyer