Transcription of Lecture 4: Functional Programming Languages (SML)
{{id}} {{{paragraph}}}
ProgrammingLanguagesLecture4: FunctionalProgrammingLanguages (SML) Benja minJ. KellerDepartment of ComputerScience,VirginiaTechProgrammingL anguages|Lecture3 |FunctionalLanguages (SML) 2 LectureOutline Overview Primitive DataTypes (Built-in)StructuredDataTypes PatternMatching Type Inference Polymorphism Declarations ExamplesProgrammingLanguages|Lecture3 |FunctionalLanguages (SML) 3 LectureOutline Exceptions HigherOrderFunctions ProgramCorrectness Imperative LanguageFeatures Implementation E ciency Concurrency SummaryProgrammingLanguages|Lecture3 |FunctionalLanguages (SML) 4 Overviewof ML Developed in Edinburghin late1970's Meta-Languageforautomatedtheoremprovings ystem Designedby RobinMilner,Mike Gordon,ChrisWadsworth Foundusefulandextendedto programminglanguageProgrammingLanguages| Lecture3 |FunctionalLanguages (SML) 5 FunctionalProgrammingin ML Functionalprogramsaremadeupof functionsappliedto data We writeexpressionsratherthancommands Purefunctionallanguageshave nosidee ects MLis nota purelanguage{referencevariables{commands {I/OProgrammingLanguages|Lecture3 |FunctionalLanguages (SML) 6 MLCharacteristics Functionsas rstclassvalues Staticallyscoped Statictypingviatype inference Polymorphictypes Type systemincludessupportforADTs Exceptionhandling GarbagecollectionProgrammingLanguages|Le cture3 |FunctionalLanguages (SML) 7 UsingMLInterpreter TypesmlStandardML of NewJersey, ,January30,1998- Hyphen(-) is prompt Canloadde nitionsfrom " "; Endsessionby typingctrl-dProgrammingLanguages|L}}}
Programming Languages Lecture 4: Functional Programming Languages (SML) Benjamin J. Keller Department of Computer Science, Virginia Tech
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}