191 search results - page 22 / 39 » Generating Heap-Bounded Programs in a Functional Setting |
PEPM
1998
ACM
13 years 12 months ago
1998
ACM
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
MP
2008
13 years 7 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
AIPS
1996
13 years 9 months ago
1996
Informationgathering requires locating and integrating data froma set of distributed informationsources. These sources maycontain overlapping data and can comefrom different types...
JCC
2008
13 years 7 months ago
2008
: We introduce PULCHRA, a fast and robust method for the reconstruction of full-atom protein models starting from a reduced protein representation. The algorithm is particularly su...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...