Мобильная версия

Доступно журналов:

2 361

Доступно статей:

3 493 662

 

Cambridge University Press по журналам "Journal of Functional Programming"

Отсортировать по: Порядок: Результаты:

  • Asperti Andrea (Cambridge University Press. Cambridge, UK, 1992-01-01)
    In the last two decades, category theory has become one of the main tools for the denotational investigation of programming languages. Taking advantage of the algebraic nature of the categorical semantics, and of the ...
  • Tolmach Andrew; Appel Andrew W. (Cambridge University Press. Cambridge, UK, 1995-04-01)
    We have built a portable, instrumentation-based, replay debugger for the Standard ML of New Jersey compiler. Traditional ‘source-level’ debuggers for compiled languages actually operate at machine level, which makes them ...
  • Runciman Colin; Toyn Ian; Firth Mike (Cambridge University Press. Cambridge, UK, 1993-01-01)
    Most programming environments for functional languages offer a single tool used to evaluate programs – either a batch compiler or an interpreter with a read-eval-print loop. This paper presents a programming environment ...
  • Davy J. R.; Dew P. M. (Cambridge University Press. Cambridge, UK, 1995-07-01)
    Solid modelling using constructive solid geometry (CSG) includes many examples of stylised divide-and-conquer algorithms. We identify the sources of these recurrent patterns and describe a Geometric Evaluation Library (GEL) ...
  • Sørensen M. H.; Glück R.; Jones N. D. (Cambridge University Press. Cambridge, UK, 1996-11-01)
    We introduce a positive supercompiler, a version of Turchin's supercompiler maintaining only positive information during transformation, and using folding without generalization. The positive supercompiler can also be ...
  • Johnson Thomas (Cambridge University Press. Cambridge, UK, 1992-04-01)
  • Aharoni Gad; Feitelson Dror G.; Barak Amnon (Cambridge University Press. Cambridge, UK, 1992-10-01)
    We present an on-line (run-time) algorithm that manages the granularity of parallel functional programs. The algorithm exploits useful parallelism when it exists, and ignores ineffective parallelism in programs that produce ...
  • Cardelli Luca; Longo Giuseppe (Cambridge University Press. Cambridge, UK, 1991-10-01)
    Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics of Quest is rather challenging. In particular, ...
  • Bezem Marc; Springintveld Jan (Cambridge University Press. Cambridge, UK, 1996-09-01)
  • Wainwright Roger L.; Sexton Marian E. (Cambridge University Press. Cambridge, UK, 1992-01-01)
    This paper compares three different sparse matrix representations in Miranda for solving linear systems of equations: quadtrees, binary trees and run-length encoding. It compares the three data structures in each of two ...
  • Jones Mark P. (Cambridge University Press. Cambridge, UK, 1995-01-01)
    This paper describes a flexible type system that combines overloading and higher-order polymorphism in an implicitly typed language using a system of constructor classes—a natural generalization of type classes in Haskell. ...
  • Coquand Thierry; Herbelin Hugo (Cambridge University Press. Cambridge, UK, 1994-01-01)
    We present here a generalization of A-translation to a class of pure type systems. We apply this translation to give a direct proof of the existence of a looping combinator in a large class of inconsistent type systems, a ...
  • Неизвестный автор (Cambridge University Press. Cambridge, UK, 1991-10-01)
  • Неизвестный автор (Cambridge University Press. Cambridge, UK, 1992-10-01)
  • Неизвестный автор (Cambridge University Press. Cambridge, UK, 1993-10-01)
  • Неизвестный автор (Cambridge University Press. Cambridge, UK, 1995-10-01)
  • Неизвестный автор (Cambridge University Press. Cambridge, UK, 1996-11-01)
  • Hartel Pieter H.; Feeley Marc; Alt Martin; Augustsson Lennart; Baumann Peter; Beemster Marcel; Chailloux Emmanuel; Flood Christine H.; Grieskamp Wolfgang; Van Groningen John H. G.; Hammond Kevin; Hausman Bogumil; Ivory Melody Y.; Jones Richard E.; Kamperman Jasper; Lee Peter; Leroy Xavier; Lins Rafael D.; Loosemore Sandra; Röjemo Niklas; Serrano Manuel; Talpin Jean-Pierre; Thackray Jon; Thomas Stephen; Walters Pum; Weis Pierre; Wentworth Peter (Cambridge University Press. Cambridge, UK, 1996-07-01)
    Over 25 implementations of different functional languages are benchmarked using the same program, a floating-point intensive application taken from molecular biology. The principal aspects studied are compile time and ...
  • Kamareddine Fairouz; Nederpelt Rob (Cambridge University Press. Cambridge, UK, 1996-03-01)
    In this article, we extend the Barendregt Cube with ∏-conversion (which is the analogue of β-conversion, on product type level) and study its properties. We use this extension to separate the problem of whether a term is ...
  • Hill Steve (Cambridge University Press. Cambridge, UK, 1996-05-01)
    This paper describes a scheme for constructing parsers based on the top-down combinator approach. In particular, it describes a set of combinators for parsing expressions described by ambiguous grammars with precedence and ...