2013-11-01 12:30:24 by Jaap Boender | Files touched by this commit (47) | |
Log message: Revision bump associated with the update of lang/ocaml to version 4.01. |
2012-12-20 23:07:57 by Joerg Sonnenberger | Files touched by this commit (2) |
Log message: -R is a linker flag, so prefix with -Wl. |
2012-10-08 17:18:26 by Jaap Boender | Files touched by this commit (54) | |
Log message: Revision bump associated with the update of lang/ocaml to version 4. |
2012-10-02 22:11:57 by Aleksej Saushev | Files touched by this commit (187) |
Log message: Drop superfluous PKG_DESTDIR_SUPPORT, "user-destdir" is default these days. |
2011-12-06 01:19:26 by Steven Drake | Files touched by this commit (42) |
Log message: Recursive bump for lang/ocaml buildlink addition. |
2011-09-05 02:15:37 by David A. Holland | Files touched by this commit (5) |
Log message: void main |
2009-12-07 23:56:02 by Joerg Sonnenberger | Files touched by this commit (1) |
Log message: Not MAKE_JOBS_SAFE. |
2009-10-29 11:10:57 by Aleksej Saushev | Files touched by this commit (1) |
Log message: Define TEST_TARGET. |
2009-10-28 07:13:40 by David A. Holland | Files touched by this commit (23) | |
Log message: Initial import of Pict 4.1 into the NetBSD package system. Pict is a language in the ML tradition, formed by adding a layer of convenient syntactic sugar and a static type system to a tiny core. The current release includes a Pict-to-C compiler, reference manual, language tutorial, numerous libraries, and example programs. The core language - an asynchronous variant of Milner, Parrow, and Walker's pi-calculus - has been used as a theoretical foundation for a broad class of concurrent computations. The goal in Pict is to identify high-level idioms that arise naturally when these primitives are used to build working programs - idioms such as basic data structures, protocols for returning results, higher-order programming, selective communication, and concurrent objects. The type system integrates a number of features found in recent work on theoretical foundations for typed object-oriented languages: higher-order polymorphism, simple recursive types, subtyping, and a powerful partial type inference algorithm. |