Ponder
A non-strict polymorphic, functional language by Jon Fairbairn . Ponder' s type system is unusual. It is more powerful than the Hindley-Milner type system used by ML and Miranda and extended by Haskell. Ponder adds extra recursive ' mu' types to those of Girard' s System F, allowing more general recursion. Surprisingly, the type system and {type inference} {algorithm} are still not completely understood. ["Ponder and its Type System", J. Fairbairn, TR 31, Cambridge U Computer Lab, Nov 1982]. [J. Fairbairn, "Design and Implementation of a Simple Typed Language based on the Lambda-Calculus", Technical Report No. 75, Computer Laboratory, University of Cambridge, May 1985]. [J. Fairbairn, "A New Type-Checker for a Functional Language", Technical Report No. 53, Computer Laboratory, University of Cambridge, 1984]. [J. Fairbairn, "Some Types with Inclusion Properties in forall, ightarrow, mu", Technical Report No. 171, Computer Laboratory, University of Cambridge, Jun 1989]. [Valeria C. V. de Paiva, "Subtyping in Ponder (Preliminary Report)", Technical Report No. 203, Computer Laboratory, University of Cambridge, Aug 1990]. In addition suitable contents:
[ 2 ] [ = ] [ @ ] [ ad ] [ ag ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ ba ] [ base ] [ bd ] [ bo ] [ br ] [ bridge ] [ bt ] [ by ] [ C ] [ ca ] [ Calc ] [ Ch ] [ ch ] [ ck ] [ cl ] [ co ] [ com ] [ complete ] [ Computer ] [ cu ] [ D ] [ dd ] [ de ] [ du ] [ ec ] [ ed ] [ er ] [ era ] [ es ] [ et ] [ extend ] [ fi ] [ file ] [ fo ] [ for ] [ fora ] [ Fun ] [ function ] [ functional ] [ functional language ] [ G ] [ ge ] [ gen ] [ gh ] [ gl ] [ gn ] [ gu ] [ h ] [ hm ] [ hn ] [ hose ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ inference ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ ke ] [ la ] [ language ] [ lc ] [ Lex ] [ li ] [ lu ] [ ly ] [ M ] [ Miranda ] [ ML ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ no ] [ nu ] [ om ] [ op ] [ pe ] [ ph ] [ ping ] [ pl ] [ polymorphic ] [ port ] [ pr ] [ query ] [ rc ] [ re ] [ recursion ] [ recursive ] [ ro ] [ row ] [ S ] [ se ] [ si ] [ sig ] [ sit ] [ sk ] [ st ] [ strict ] [ su ] [ sy ] [ system ] [ System F ] [ T ] [ tar ] [ th ] [ to ] [ tr ] [ type ] [ type inference ] [ ua ] [ ug ] [ uk ] [ us ] [ V ] [ va ] [ ve ] [ win ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (4946 Reads) |
