Editing ISWIM (section)

== Implementations and derivatives ==
No direct implementation of ISWIM was completed but Art Evan's language ''[[PAL (programming language)|PAL]]'',<ref>{{Cite conference |last=Evans |first=Art |date=1968 |title=PAL: a language designed for teaching programming linguistics |book-title=Proceedings ACM National Conference |conference=ACM National Conference |publisher=[[Association for Computing Machinery]]}}</ref> and [[John C. Reynolds]]' language ''Gedanken'',<ref>{{Cite report |last=Reynolds |first=John C. |author-link=John C. Reynolds |date=September 1969 |title=GEDANKEN: a simple typeless language which permits functional data structures and co-routines |publisher=Argonne National Laboratory}}</ref> captured most of Landin's concepts, including powerful transfer-of-control operations. Both of these were [[Type system|typed dynamically]]. [[Robin Milner]]'s [[ML (programming language)|ML]] may be considered equivalent to I<small>SWIM</small> without the [[J operator]] and with [[type inference]].

Another line of descent from ISWIM is to strip out the imperative features (assignment and the J operator) leaving a purely functional language.<ref>{{Cite journal |last1=Ivanović |first1=Mirjana |last2=Budimac |first2=Zoran |date=April 1993 |title=A definition of an ISWIM-like language via Scheme |journal=ACM SIGPLAN Notices |volume=28 |issue=4|pages=29–38 |doi=10.1145/152739.152743 |s2cid=14379260 |doi-access=free }}</ref> It then becomes possible to switch to [[lazy evaluation]]. This path led to programming languages [[SASL (programming language)|SASL]], [[Kent Recursive Calculator]] (KRC), [[Hope (programming language)|Hope]], [[Miranda (programming language)|Miranda]], [[Haskell (programming language)|Haskell]], and [[Clean (programming language)|Clean]].