|
| |
| | Haskell: Influences |
 | | Based on some of the syntactic ideas of ISWIM, it was developed as a meta language for the object language pplambda for the Edinburgh LCF (Logic for Computable Functions) proof assistant but soon became used as a general purpose language. | | | ISWIM (If you See What I Mean) is a programming language (or "family of programming languages") described in March 1966 by Peter J. Landin which has only been implemented experimentally. | | | ISWIM was influenced by LISP and in the same article Landin said "...can be looked upon as an attempt to deliver Lisp from its eponymous commitment to lists, its reputation for hand-to-mouth storage allocation, the hardware dependent flavour of its pedagogy, its heavy bracketing, and its compromises with tradition". |
|
http://www.bath.ac.uk/~cs3nb/Prog4/Whatinfluenceditsdesign.html
(759 words)
|
|
| |
| | Peter J. Landin: Information From Answers.com |
| | He is responsible for inventing the SECD machine and the ISWIM programming language, and for coining the term "syntactic sugar". |
|
http://www.answers.com/topic/peter-j-landin
(111 words)
|
|
| |
| | Programming 4 - Group 6 - Basic Version |
| | PAL is also a powerful programming language therefore students were able to apply concepts learnt to solve complex programming problems using PAL, which allows students not only to develop their problem-solving skills but also to develop the necessary tools to be able to solve realistic problems. | | | Originally implemented by Landin and James H. Morris in LISP, PAL (Pedagogic Algorithmic Language) is a type-less, higher-order functional language, descended from ISWIM. | | | PAL is a type-less, higher order language, in the same way as QUEST and EULER, meaning that a value of any type can be stored in a location, including strings, lists, references or functions. |
|
http://www.bath.ac.uk/~cs3rcp/prog4/pal_basic.html
(1959 words)
|
|
| |
| | Guard (computing) - Wikipedia, the free encyclopedia |
| | In the case of ISWIM, if none of the alternatives could be used, the value was to be undefined, which was defined to never compute into a value. | | | SASL (1976) was one of the first programming languages to use the term guard. | | | Already ISWIM in 1966 had a form of conditional expression without an obligatory fall-through case, thus separating guard from the concept of choosing either-or. |
|
http://en.wikipedia.org/wiki/Guard_statement
(577 words)
|
|
| |
| | Q and Lucid |
| | Lucid extends the simple applicative expressiveness of ISWIM with an intensional logic using a multidimensional space. | | | 2] is a intensional, stream-based, multidimensional programming language, derived from Landin's ISWIM[ | | | The single variable of a simple algebra is extended into a stream which spans any dimensions over which the variable changes. |
|
http://web.media.mit.edu/~wad/magiceight/isa/node20.html
(298 words)
|
|
| |
| | demerol.ca - ISWIM |
| | ISWIM is an abstract computer programming language (or a family of programming languages) devised by Peter J. http://en.wikipedia.org/wiki/ISWIM | | | The CC, CK and CEK Machines -- ISWIM in... | | | below to go directly to a page where "ISWIM" is defined. |
|
http://www.demerol.ca/ISWIM/reference/fullview/wikipedia/233385
(91 words)
|
|
| |
| | Iswim |
| | The specification of the Cc.eval, Ck.eval and Cek.eval functions come from Felleisen and Flatt -- Programming Languages and Lambda Calculi. | | | The CC, CK and CEK Machines -- ISWIM interpreters dvanhorn@cs.uvm.edu |
|
http://www.cs.uvm.edu/~dvanhorn/ocaml/iswim/doc/Iswim.html
(44 words)
|
|
| |
| | ISWIM bei eLexi - das Onlinelexikon |
| | ISWIM is a programming language devised by Peter J. Landin and first described in his article, The next 700 programming languages, published in the CACM in 1966. | | | It has proved very influential in the development of functional programming languages such as SASL, Miranda, ML and their successors. | | | Harry Max Markowitz (born August 24, 1927) was an influential economist and winner of the Nobel Prize in economics, the Bank of Sweden Prize in Economic Sciences in Memory of Alfred Nobel in 1990. |
|
http://www.elexi.de/en/i/is/iswim.html
(362 words)
|
|
| |
| | ISWIM - OneLook Dictionary Search |
| | ISWIM : Free On-line Dictionary of Computing [home, info] | | | Tip: Click on the first link on a line below to go directly to a page where "ISWIM" is defined. | | | We found 3 dictionaries with English definitions that include the word ISWIM: |
|
http://www.onelook.com/cgi-bin/cgiwrap/bware/dofind.cgi?word=ISWIM
(77 words)
|
|
| |
| | towards a modern programming environment |
| | One might argue that the level of chunking has to be fairly high, for in the case of changing both interface and implementation multiple files often will need simultaneous coherent changes to make semantically valid alterations. | | | > The ISWIM (If you See What I Mean) system is a byproduct of an attempt > to disentangle these two aspects in some current languages. | | | Conversely, it is a special > case of the thesis underlying ISWIM that any pidgin English that has > so far been implemented can be stripped to pidgin algebra. |
|
http://lists.canonical.org/pipermail/kragen-discuss/2003-May/000911.html
(1101 words)
|
|
| |
| | iSWIM |
| | Below is an example of how an iPlay customer might navigate through a Leisure-Information-Package: | | | iSWIM Leisure-Information-Package will soon be available to download and print, or display on any Palm OS device, and will include the following information: |
|
http://www.iplaypda.com/iswim.html
(37 words)
|
|
| |
| | The Tail Recursive SECD Machine |
| | ISWIM has an operational semantics given by the SECD machine. | | | The cost of efficient support for iteration is small. | | | More than twenty years ago, Gordon Plotkin published a famous paper that examines the relation between the Lambda Calculus and ISWIM, a programming language based on the Lambda Calculus |
|
http://www.cs.utexas.edu/users/boyer/ftp/nqthm/trsecd/trsecd.html
(2298 words)
|
|
| |
| | Operational Methods (ResearchIndex) |
| | See Larry Paulson's Part IB course Foundations of Functional Programming for a discussion of SECD machine. | | | Abstract: Machines SECD = Stack Environment Control Dump ISWIM = If You See What I Mean FAM = Functional Abstract Machine Tim = Three Instruction Machine CAM = Categorical Abstract Machine ZINC = ZINC Is Not CAML Also G-machine, STG-machine for Haskell. |
|
http://citeseer.ist.psu.edu/481297.html
(161 words)
|
|
| |
| | Reviews.com |
| | Browse All Reviews > Software (D) > Programming Languages (D.3) > Language Classifications (D.3.2) > Iswim (D.3.2...) | | | There are currently no reviews available for "Iswim (D.3.2)": |
|
http://www.reviews.com/browse/browse_topics4.cfm?ccs_id=786
(36 words)
|
|
| |
| | Remaining questions & remarks (2) |
| | I think you should research the languages GEDANKEN (Reynolds) and ISWIM (Landin), as one of those might have had closures. | | | I believe ISWIM was described in CACM in the mid-1960's. | | | Kelsey asks: why does ROUND round to even? |
|
http://martigny.ai.mit.edu/pipermail/rrrs-authors/1986-June/000499.html
(289 words)
|
|
| |
| | [No title] |
| | topoi) 1966 Landin, The next 700 programming languages: ISWIM 1968 ? | | | In contrast, languages such as Iswim, PAL, Gedanken, Scheme, and ML were built around the rallying cry 'functions should be first-class citizens'." [Reynolds p.286] 1. |
|
http://www.kx.com/technical/contribs/stephen/talk1.txt
(978 words)
|
|
| |
| | Scheme - Usenet category theory |
| | You knew darn well that you were implementing your semantics, | | | is definitely not part of my ISWIM language. | | | But what I posted was an interpreter for F-F's ISWIM language, which |
|
http://www.codecomments.com/archive282-2004-8-252042.html
(4537 words)
|
|
| |
| | ISWIM |
| | ISWIM was the first language to use lazy evaluation, and introduced the offside rule for indentation. | | | ISWIM was the first language to use lazy-evaluation and introduced the off-side rule for indentation. | | | ISWIM is purely functional, a sugaring of lambda calculus, and the ancestor of most modern applicative languages. |
|
http://hopl.murdoch.edu.au/showlanguage.prx?exp=261&language=ISWIM
(324 words)
|
|
| |
| | ISWIM RUG RECTANGLE SM |
| | ISWIM RUG RECTANGLE SM Dimensions: 26.5" X 17.5" |
|
http://www.digster.com/browseproducts/ISWIM-RUG-RECTANGLE-SM.HTML
(8 words)
|
|
| |
| | Lazy evaluation alternative |
| | Next a call-by-name variant of ISWIM is introduced which is in an analogous correspondence with the usual $\lambda$-calculus. | | | The relation between call-by-value and call-by-name is then studied by giving simulations of each language by the other and interpretations of each calculus in the other. | | | Since this leads to difficulties, a new $\lambda$-calculus is introduced whose standardisation theorem gives a good correspondence with ISWIM as given by the SECD machine, but without the \emph{letrec} feature. |
|
http://www.haskell.org/pipermail/haskell/2003-January/011057.html
(340 words)
|
|
| |
| | [No title] |
| | Will reproved this result (in his context) in > his 2nd ISWIM post. | | | But what only you & I understand is that it's compositional. | | | And if so, there's no reason for you to think about my Bill-compositionality definition yet. |
|
http://www.ccs.neu.edu/home/will/Ephemera/category3.txt
(1303 words)
|
|
| |
| | The Encyclopedia of Computer Languages |
| | The language they implemented was much closer to ISWIM than to PAL as it now exists. | | | The first implementation of PAL was by Landin and James H. Morris, Jr., in LISP. | | | The present version of PAL was designed by Martin Richards along with Thomas J. Barkalow, Evans, Robert M. Graham, Morris and John M. Wozencraft. |
|
http://hopl.murdoch.edu.au/showlanguage.prx?exp=336
(4001 words)
|
|
| |
| | Syllabus |
| | A more detailed syllabus may be provided during the quarter, if I find the time. | | | FF II ISWIM: lambda calculus, consistency, standard reductions |
|
http://www.ccs.neu.edu/home/matthias/3810-w02/syllabus.html
(118 words)
|
|
|
