DOCSLIB.ORG

Recursive Structures for Standard ML

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Recursive Structures for Standard ML Recursive Structures for Standard ML Claudio V. Russo Microsoft Research Ltd., St George House, 1 Guildhall Street, Cambridge CB2 3NH [email protected] ABSTRACT both small and large programs. SML’s general-purpose Core Standard ML is a statically typed programming language language supports “programming in the small” with a rich that is suited for the construction of both small and large range of types and computational constructs that includes programs. “Programming in the small” is captured by Stan- mutually recursive datatypes and functions, control con- dard ML’s Core language. “Programming in the large” structs, exceptions and references. is captured by Standard ML’s Modules language that pro- SML’s special-purpose Modules language supports “pro- vides constructs for organising related Core language defini- gramming in the large”. Constructed on top of the Core, tions into self-contained modules with descriptive interfaces. the Modules language allows sequential definitions of identi- While the Core is used to express details of algorithms and fiers denoting Core language types and terms to be packaged data structures, Modules is used to express the overall archi- together into possibly nested structures, whose components tecture of a software system. In Standard ML, modular pro- are accessed by the dot notation. Structures are transpar- grams must have a strictly hierarchical structure: the depen- ent:bydefault,therealisation (i.e. implementation) of a dency between modules can never be cyclic. In particular, type component within a structure is evident outside the definitions of mutually recursive Core types and values, that structure. Signatures are used to specify the types of struc- arise frequently in practice, can never span module bound- tures, by specifying their individual components. A type aries. This limitation compromises modular programming, component may be specified opaquely, permitting a variety forcing the programmer to merge conceptually (i.e. archi- of realisations, or transparently, by equating it with a partic- tecturally) distinct modules. We propose a practical and ular Core type ([10] uses the terminology abstract and man- simple extension of the Modules language that caters for ifest instead; we follow [8]). A structure matches asigna- cyclic dependencies between both types and terms defined ture if it provides an implementation for all of the specified in separate modules. Our design leverages existing features components, and, thanks to the subtyping relation called of the language, supports separate compilation of mutually enrichment, possibly more. A signature may be used to recursive modules and is easy to implement. opaquely constrain a matching structure. This existentially quantifies over the actual realisation of type components that have opaque specifications in the signature, effectively Categories and Subject Descriptors hiding their implementation. A functor definition defines a D.3.3 [Programming Languages]: Language Constructs polymorphic function mapping structures to structures. A and Features—Modules,packages functor may be applied to any structure that realises a sub- type of the formal argument’s type, resulting in a concrete General Terms implementation of the functor body. Despite the flexibility of the Modules type system, it does LANGUAGES, THEORY suffer from an awkward limitation. Unlike the definitions of the Core language, module bindings must have a strictly Keywords hierarchical structure: the dependency between modules can recursive modules, datatypes, Standard ML, type theory never be cyclic. In particular, although definable within the confines of a single module, definitions of mutually recursive 1. INTRODUCTION types and values can never span module boundaries. While this does not affect the expressiveness of the Core language, Standard ML [12] (henceforth SML) is a high-level pro- the restriction does compromise modular programming. The gramming language that is suited for the construction of programmer is typically left with two choices. She can either merge conceptually distinct modules into a single module, just to satisfy the type checker. Or she can resort to tricky Permission to make digital or hard copies of all or part of this work for encodings in the Core language to break the cycles between personal or classroom use is granted without fee provided that copies are modules. The first approach obscures the architecture of the not made or distributed for pro£t or commercial advantage and that copies program; the second obscures its implementation. Neither bear this notice and the full citation on the £rst page. To copy otherwise, to solution is satisfactory. republish, to post on servers or to redistribute to lists, requires prior speci£c In this article, we relax the hierarchical structure of Mod- permission and/or a fee. ICFP’01, September 3-5, 2001, Florence, Italy. ules, allowing structures to be recursive. Our extension sup- Copyright 2001 ACM 1-58113-415-0/01/0009 ...$5.00. 50 ports mutual recursion at the level of Core datatypes and components, and possibly more. A structure matches asig- (independently) values. Although different in detail, our nature containing opaque type or datatype specifications if proposal may be seen as adapting Crary, Harper and Puri’s it enriches a complete realisation of that signature. theoretical analysis of module recursion to Standard ML [2]. Core expressions e describe a simple functional language Our main contribution is to provide a practical type system extended with the projection of a value identifier from a for recursive modules in Standard ML that avoids some of structure path. Constructor applications and case expres- the typing challenges of the formalism in [2], and exploits sions are tagged with the name of the datatype (tp) that Standard ML’s subtyping on modules to provide slightly they introduce or eliminate. A constructor application takes more expressive and convenient constructs. Our extension the values of its n arguments and builds a tuple tagged with preserves the existing features of Standard ML. the constructor c, introducing a value of type tp. The typ- For presentation purposes, we formulate our extension, ing rules ensure that the constructor is fully applied. A case not for Standard ML, but for a representative toy language expression evaluates e to a constructed value of type tp and called Mini-SML. The static semantics of Mini-SML is based choosesacontinuationbasedonthetagofthisvalue.Kisa directly on that of Standard ML. Mini-SML includes the es- finite set of constructors used to index the set of alternative sential features of Standard ML Modules but, for brevity, continuations. Each alternative binds nc constructor argu- only has a simple Core language of explicitly typed, mono- ments xc,0 ···xc,nc−1 in the continuation body ec (typing morphic functions and non-parametric type and datatype will ensure that nc is the arity of c in the datatype). A case definitions. [14] treats a more realistic Standard ML-like expression need not be exhaustive, in which case evaluation Core with implicitly typed, polymorphic functions and pa- aborts by raising the built-in exception match. rameterised type definitions. Our proposal has been adapted A structure path sp is a reference to a bound structure to full Standard ML and is available in MoscowML [17]. identifier, or the projection of one of its substructures. A Section 2 introduces the syntax of Mini-SML. Sections 3 structure body b is a dependent sequence of definitions: sub- gives a motivating example to illustrate the limitations of sequent definitions may refer to previous ones. A type def- acyclic Modules. Section 4 reviews the static semantics of inition abbreviates a type. A datatype definition is like a Mini-SML. Section 5 defines our extension to recursive mod- datatype specification but generates a new(and thus dis- ules and its static and dynamic semantics. Section 6 recasts tinct) type with the corresponding set of constructors. As the first example so that its mutually dependent components in signatures, datatype replication declares a datatype that may be separately compiled. Section 7 presents a real-world is equivalent to, and thus compatible with, the datatype tp. example that uses recursive modules to implement an ad- Datatype replication is used to copy a datatype into an- vanced data structure. Section 8 assesses our contribution. other scope whilst preserving compatibility with that type. Value, recursive function and structure definitions bind term 2. THE SYNTAX OF MINI-SML identifiers to the values of expressions. A functor definition introduces a named function on structures: X is the func- Figure 1 defines the abstract syntax of Mini-SML. A type tor’s formal argument, S specifies the argument’s type, and s path tp is a projection t or sp.t of a (Core) type component is the functor’s body that may refer to X. The functor may from the context or a structure path. A core type umaybe be applied to any argument that matches S. A signature used to define a type identifier or to specify the type of a definition abbreviates a signature. A structure expression s Core value. These are just the types of a simple functional evaluates to a structure. It may be a path or an encapsulated language, extended with type paths. A signature body Bisa structure body, whose type, value and structure definitions sequential specification of a structure’s components. A type become the components of the structure. The application of component may be specified transparently, by equating it a functor evaluates its body against the value of the actual with a type, or opaquely, permitting a variety of realisations argument. A transparent constraint (s : S) restricts the (ie. implementations). The implementation of a transpar- visibility of the structure’s components to those specified in ent component is fixed (up to the realisation of any opaque the signature, which the structure must match, and reveals types that it mentions). An opaque datatype specification the actual realisations of all type components in the sig- describes an arbitrary (recursive) datatype with finite set of nature (even those with opaque specifications).
Load more

Recommended publications
  • Scoping Changes with Method Namespaces
    Scoping Changes with Method Namespaces Alexandre Bergel ADAM Project, INRIA Futurs Lille, France [email protected] Abstract. Size and complexity of software has reached a point where modular constructs provided by traditional object-oriented programming languages are not expressive enough. A typical situation is how to modify a legacy code without breaking its existing clients. We propose method namespaces as a visibility mechanism for behavioral refine- ments of classes (method addition and redefinition). New methods may be added and existing methods may be redefined in a method namespace. This results in a new version of a class accessible only within the defining method namespace. This mechanism, complementary to inheritance in object-orientation and tradi- tional packages, allows unanticipated changes while minimizing the impact on former code. Method Namespaces have been implemented in the Squeak Smalltalk system and has been successfully used to provide a translated version of a library without ad- versely impacting its original clients. We also provide benchmarks that demon- strate its application in a practical setting. 1 Introduction Managing evolution and changes is a critical part of the life cycle of all software sys- tems [BMZ+05, NDGL06]. In software, changes are modeled as a set of incremental code refinements such as class redefinition, method addition, and method redefinition. Class-based object-oriented programming languages (OOP) models code refinements with subclasses that contain behavioral differences. It appears that subclassing is well adapted when evolution is anticipated. For example, most design patterns and frame- works rely on class inheritance to express future anticipated adaptation and evolution. However, subclassing does not as easily help in expressing unanticipated software evo- lution [FF98a, BDN05b].
    [Show full text]
  • Openedge Development: Progress 4GL Handbook Contents
    OpenEdgeTM Development: Progress® 4GL Handbook John Sadd Expert Series © 2003 Progress Software Corporation. All rights reserved. Progress® software products are copyrighted and all rights are reserved by Progress Software Corporation. This manual is also copyrighted and all rights are reserved. This manual may not, in whole or in part, be copied, photocopied, translated, or reduced to any electronic medium or machine-readable form without prior consent, in writing, from Progress Software Corporation. The information in this manual is subject to change without notice, and Progress Software Corporation assumes no responsibility for any errors that may appear in this document. The references in this manual to specific platforms supported are subject to change. Allegrix, A [Stylized], ObjectStore, Progress, Powered by Progress, Progress Fast Track, Progress Profiles, Partners in Progress, Partners en Progress, Progress en Partners, Progress in Progress, P.I.P., Progress Results, ProVision, ProCare, ProtoSpeed, SmartBeans, SpeedScript, and WebSpeed are registered trademarks of Progress Software Corporation or one of its subsidiaries or affiliates in the U.S. and/or other countries. A Data Center of Your Very Own, Allegrix & Design, AppsAlive, AppServer, ASPen, ASP-in-a-Box, BusinessEdge, Business Empowerment, Empowerment Center, eXcelon, Fathom, Future Proof, IntelliStream, ObjectCache, OpenEdge, PeerDirect, POSSE, POSSENET, ProDataSet, Progress Business Empowerment, Progress Dynamics, Progress Empowerment Center, Progress Empowerment Program, Progress for Partners, Progress OpenEdge, Progress Software Developers Network, PSE Pro, PS Select, SectorAlliance, SmartBrowser, SmartComponent, SmartDataBrowser, SmartDataObjects, SmartDataView, SmartDialog, SmartFolder, SmartFrame, SmartObjects, SmartPanel, SmartQuery, SmartViewer, SmartWindow, Technical Empowerment, Trading Accelerator, WebClient, and Who Makes Progress are trademarks or service marks of Progress Software Corporation or one of its subsidiaries or affiliates in the U.S.
    [Show full text]
  • Investigating Powershell Attacks
    Investigating PowerShell Attacks Black Hat USA 2014 August 7, 2014 PRESENTED BY: Ryan Kazanciyan, Matt Hastings © Mandiant, A FireEye Company. All rights reserved. Background Case Study WinRM, Victim VPN SMB, NetBIOS Attacker Victim workstations, Client servers § Fortune 100 organization § Command-and-control via § Compromised for > 3 years § Scheduled tasks § Active Directory § Local execution of § Authenticated access to PowerShell scripts corporate VPN § PowerShell Remoting © Mandiant, A FireEye Company. All rights reserved. 2 Why PowerShell? It can do almost anything… Execute commands Download files from the internet Reflectively load / inject code Interface with Win32 API Enumerate files Interact with the registry Interact with services Examine processes Retrieve event logs Access .NET framework © Mandiant, A FireEye Company. All rights reserved. 3 PowerShell Attack Tools § PowerSploit § Posh-SecMod § Reconnaissance § Veil-PowerView § Code execution § Metasploit § DLL injection § More to come… § Credential harvesting § Reverse engineering § Nishang © Mandiant, A FireEye Company. All rights reserved. 4 PowerShell Malware in the Wild © Mandiant, A FireEye Company. All rights reserved. 5 Investigation Methodology WinRM PowerShell Remoting evil.ps1 backdoor.ps1 Local PowerShell script Persistent PowerShell Network Registry File System Event Logs Memory Traffic Sources of Evidence © Mandiant, A FireEye Company. All rights reserved. 6 Attacker Assumptions § Has admin (local or domain) on target system § Has network access to needed ports on target system § Can use other remote command execution methods to: § Enable execution of unsigned PS scripts § Enable PS remoting © Mandiant, A FireEye Company. All rights reserved. 7 Version Reference 2.0 3.0 4.0 Requires WMF Requires WMF Default (SP1) 3.0 Update 4.0 Update Requires WMF Requires WMF Default (R2 SP1) 3.0 Update 4.0 Update Requires WMF Default 4.0 Update Default Default Default (R2) © Mandiant, A FireEye Company.
    [Show full text]
  • Unfold/Fold Transformations and Loop Optimization of Logic Programs
    Unfold/Fold Transformations and Loop Optimization of Logic Programs Saumya K. Debray Department of Computer Science The University of Arizona Tucson, AZ 85721 Abstract: Programs typically spend much of their execution time in loops. This makes the generation of ef®cient code for loops essential for good performance. Loop optimization of logic programming languages is complicated by the fact that such languages lack the iterative constructs of traditional languages, and instead use recursion to express loops. In this paper, we examine the application of unfold/fold transformations to three kinds of loop optimization for logic programming languages: recur- sion removal, loop fusion and code motion out of loops. We describe simple unfold/fold transformation sequences for these optimizations that can be automated relatively easily. In the process, we show that the properties of uni®cation and logical variables can sometimes be used to generalize, from traditional languages, the conditions under which these optimizations may be carried out. Our experience suggests that such source-level transformations may be used as an effective tool for the optimization of logic pro- grams. 1. Introduction The focus of this paper is on the static optimization of logic programs. Speci®cally, we investigate loop optimization of logic programs. Since programs typically spend most of their time in loops, the generation of ef®cient code for loops is essential for good performance. In the context of logic programming languages, the situation is complicated by the fact that iterative constructs, such as for or while, are unavailable. Loops are usually expressed using recursive procedures, and loop optimizations have be considered within the general framework of inter- procedural optimization.
    [Show full text]
  • A Right-To-Left Type System for Value Recursion
    1 A right-to-left type system for value recursion 61 2 62 3 63 4 Alban Reynaud Gabriel Scherer Jeremy Yallop 64 5 ENS Lyon, France INRIA, France University of Cambridge, UK 65 6 66 1 Introduction Seeking to address these problems, we designed and imple- 7 67 mented a new check for recursive definition safety based ona 8 In OCaml recursive functions are defined using the let rec opera- 68 novel static analysis, formulated as a simple type system (which we 9 tor, as in the following definition of factorial: 69 have proved sound with respect to an existing operational seman- 10 let rec fac x = if x = 0 then 1 70 tics [Nordlander et al. 2008]), and implemented as part of OCaml’s 11 else x * (fac (x - 1)) 71 type-checking phase. Our check was merged into the OCaml distri- 12 Beside functions, let rec can define recursive values, such as 72 bution in August 2018. 13 an infinite list ones where every element is 1: 73 Moving the check from the middle end to the type checker re- 14 74 let rec ones = 1 :: ones stores the desirable property that compilation of well-typed programs 15 75 Note that this “infinite” list is actually cyclic, and consists of asingle does not go wrong. This property is convenient for tools that reuse 16 76 cons-cell referencing itself. OCaml’s type-checker without performing compilation, such as 17 77 However, not all recursive definitions can be computed. The MetaOCaml [Kiselyov 2014] (which type-checks quoted code) and 18 78 following definition is justly rejected by the compiler: Merlin [Bour et al.
    [Show full text]
  • Resource Management: Linux Kernel Namespaces and Cgroups
    Resource management: Linux kernel Namespaces and cgroups Rami Rosen [email protected] Haifux, May 2013 www.haifux.org 1/121 http://ramirose.wix.com/ramirosen TOC Network Namespace PID namespaces UTS namespace Mount namespace user namespaces cgroups Mounting cgroups links Note: All code examples are from for_3_10 branch of cgroup git tree (3.9.0-rc1, April 2013) 2/121 http://ramirose.wix.com/ramirosen General The presentation deals with two Linux process resource management solutions: namespaces and cgroups. We will look at: ● Kernel Implementation details. ●what was added/changed in brief. ● User space interface. ● Some working examples. ● Usage of namespaces and cgroups in other projects. ● Is process virtualization indeed lightweight comparing to Os virtualization ? ●Comparing to VMWare/qemu/scaleMP or even to Xen/KVM. 3/121 http://ramirose.wix.com/ramirosen Namespaces ● Namespaces - lightweight process virtualization. – Isolation: Enable a process (or several processes) to have different views of the system than other processes. – 1992: “The Use of Name Spaces in Plan 9” – http://www.cs.bell-labs.com/sys/doc/names.html ● Rob Pike et al, ACM SIGOPS European Workshop 1992. – Much like Zones in Solaris. – No hypervisor layer (as in OS virtualization like KVM, Xen) – Only one system call was added (setns()) – Used in Checkpoint/Restart ● Developers: Eric W. biederman, Pavel Emelyanov, Al Viro, Cyrill Gorcunov, more. – 4/121 http://ramirose.wix.com/ramirosen Namespaces - contd There are currently 6 namespaces: ● mnt (mount points, filesystems) ● pid (processes) ● net (network stack) ● ipc (System V IPC) ● uts (hostname) ● user (UIDs) 5/121 http://ramirose.wix.com/ramirosen Namespaces - contd It was intended that there will be 10 namespaces: the following 4 namespaces are not implemented (yet): ● security namespace ● security keys namespace ● device namespace ● time namespace.
    [Show full text]
  • Declare and Assign Global Variable Python
    Declare And Assign Global Variable Python Unstaid and porous Murdoch never requiring wherewith when Thaddus cuts his unessential. Differentiated and slicked Emanuel bituminize almost duly, though Percival localise his calices stylize. Is Normie defunctive when Jeff objurgates toxicologically? Programming and global variables in the code shows the respondent what happened above, but what is inheritance and local variables in? Once declared global variable assignment previously, assigning values from a variable from python variable from outside that might want. They are software, you will see a mortgage of armor in javascript. Learn about Python variables plus data types, you must cross a variable forward declaration. How like you indulge a copy of view object in Python? If you declare global and. All someone need is to ran the variable only thing outside the modules. Why most variables and variable declaration with the responses. Python global python creates an assignment statement not declared globally anywhere in programming both a declaration is teaching computers, assigning these solutions are quite cumbersome. How to present an insurgent in Python? Can assign new python. If we boast that the entered value is invalid, sometimes creating the variable first. Thus of python and assigned using the value globally accepted store data. Python and python on site is available in coding and check again declare global variables can refer to follow these variables are some examples. Specific manner where a grate is screwing with us. Global variable will be use it has the python and variables, including headers is a function depending on. Local variable declaration is assigned it by assigning the variable to declare global variable in this open in the caller since the value globally.
    [Show full text]
  • Moscow ML .Net Owner's Manual
    Moscow ML .Net Owner's Manual Version 0.9.0 of November 2003 Niels Jørgen Kokholm, IT University of Copenhagen, Denmark Peter Sestoft, Royal Veterinary and Agricultural University, Copenhagen, Denmark This document describes Moscow ML .Net 0.9.0, a port of Moscow ML 2.00 to the .Net platform. The focus is on how Moscow ML .Net differs from Moscow ML 2.0. Three other documents, the Moscow ML Owner’s Manual [7], the Moscow ML Language Overview [5] and the Moscow ML Library Documentation [6] describe general aspects of the Moscow ML system. Moscow ML implements Standard ML (SML), as defined in the 1997 Definition of Standard ML, including the SML Modules language and some extensions. Moreover, Moscow ML supports most re- quired parts of the SML Basis Library. It supports separate compilation and the generation of stand-alone executables. The reader is assumed to be familiar with the .Net platform [2]. Contents 1 Characteristics of Moscow ML .Net 2 1.1 Compiling and linking 2 1.2 Command-line options 3 1.3 Additional primitives in the built-in units 3 1.4 The libraries 4 2 Installation 5 3 External programming interface 5 3.1 How external assemblies are found and loaded 5 3.2 How to call a .Net static method from Moscow ML .Net. 6 3.2.1 An example 7 3.2.2 Passing arguments and using results 7 3.2.3 Representation of ML Values 8 3.2.4 Notes 8 3.2.5 An experimental auto-marshalling import mechanism: clr_val 8 3.3 How to call an ML function from .Net 10 3.3.1 Example 10 3.3.2 Experimental, easier export of ML values via exportVal 11 The Moscow ML home page is http://www.dina.kvl.dk/~sestoft/mosml.html 1 1 Characteristics of Moscow ML .Net Unlike most other ports of Moscow ML, this port is not based on porting the Caml Light runtime, but is based on the creation of a new backend that generates .Net CIL code.
    [Show full text]
  • Objective C Runtime Reference
    Objective C Runtime Reference Drawn-out Britt neighbour: he unscrambling his grosses sombrely and professedly. Corollary and spellbinding Web never nickelised ungodlily when Lon dehumidify his blowhard. Zonular and unfavourable Iago infatuate so incontrollably that Jordy guesstimate his misinstruction. Proper fixup to subclassing or if necessary, objective c runtime reference Security and objects were native object is referred objects stored in objective c, along from this means we have already. Use brake, or perform certificate pinning in there attempt to deter MITM attacks. An object which has a reference to a class It's the isa is a and that's it This is fine every hierarchy in Objective-C needs to mount Now what's. Use direct access control the man page. This function allows us to voluntary a reference on every self object. The exception handling code uses a header file implementing the generic parts of the Itanium EH ABI. If the method is almost in the cache, thanks to Medium Members. All reference in a function must not control of data with references which met. Understanding the Objective-C Runtime Logo Table Of Contents. Garbage collection was declared deprecated in OS X Mountain Lion in exercise of anxious and removed from as Objective-C runtime library in macOS Sierra. Objective-C Runtime Reference. It may not access to be used to keep objects are really calling conventions and aggregate operations. Thank has for putting so in effort than your posts. This will cut down on the alien of Objective C runtime information. Given a daily Objective-C compiler and runtime it should be relate to dent a.
    [Show full text]
  • Explain Function Declaration Prototype and Definition
    Explain Function Declaration Prototype And Definition ligatedreprobated,Sidearm feminizes and but road-hoggish Weylin vengefully. phonemic Roderich nose-dived never reckons her acetones. his carat! Unfabled Dubitative Dewey and ill-equippedclangour, his Jerzy stringer See an example of passing control passes to function declaration and definition containing its prototype Once which is declared in definition precedes its definition of declaring a body of. Check out to explain basic elements must be explained below. They gain in this browser for types to carry out into parts of functions return statement of your pdf request that same things within your program? Arguments and definitions are explained below for this causes an operator. What it into two. In definition and declare a great; control is declared in this parameter names as declaring extern are explained in expressions and ms student at runtime error. Classes and definition was tested in a, and never executed but it will be called formal parameters are expanded at later. There are definitions to prototype definition tells the value method of an example are a function based on the warnings have had been declared. Please enter valid prototype definition looks a function definitions affects compilation. In this method is fixed words, but unlike references or rethrow errors or constants stand out its argument is only if more code by subclasses. How do is the variable of the three basic behavior of variable num to explain actual values of yours i desired. Also when a function num_multiplication function and definition example. By value of the definitions are explained in the nested function, the program passes to.
    [Show full text]
  • GFD.191 Freek Dijkstra, SARA GFSG Richard Hughes-Jones, DANTE Gregory B
    GFD.191 Freek Dijkstra, SARA GFSG Richard Hughes-Jones, DANTE Gregory B. Newby, Arctic Region Supercomputing Center Joel Replogle, Open Grid Forum December 2011 Procedure for Registration of Subnamespace Identifiers in the URN:OGF Hierarchy Status of This Document Community Practice (CP) Copyright Notice Copyright c Open Grid Forum (2011). Some Rights Reserved. Distribution is unlimited. Abstract URNs in the OGF namespace take the form urn:ogf:<snid>:<subnamespace-specific-string>. This document describes the procedure how to register subnamespace identifiers (<snid>) in the urn:ogf: namespace. Contents Abstract ........................................... 1 Contents ........................................... 1 1 introduction ....................................... 3 1.1 Notational Conventions .............................. 3 1.2 Globally Uniqueness of URNs ........................... 3 1.3 Persistency of URNs ................................ 4 2 Selecting a Namespace ................................. 4 3 Canonical Syntax of URN:OGF identifiers ........................ 5 4 Procedure for Registering a Namespace Identifier .................... 6 5 Review Criteria for SNID Proposals ........................... 7 1 GFD.191 December 2011 6 Template for Registering a Namespace Identifier .................... 8 7 Security Considerations ................................. 18 8 Glossary ......................................... 18 9 Contributors ....................................... 19 10 Acknowledgments .................................... 20 Intellectual
    [Show full text]
  • Functional Programming (ML)
    Functional Programming CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Functional Programming Function evaluation is the basic concept for a programming paradigm that has been implemented in functional programming languages. The language ML (“Meta Language”) was originally introduced in the 1970’s as part of a theorem proving system, and was intended for describing and implementing proof strategies. Standard ML of New Jersey (SML) is an implementation of ML. The basic mode of computation in SML is the use of the definition and application of functions. 2 (c) Paul Fodor (CS Stony Brook) Install Standard ML Download from: http://www.smlnj.org Start Standard ML: Type ''sml'' from the shell (run command line in Windows) Exit Standard ML: Ctrl-Z under Windows Ctrl-D under Unix/Mac 3 (c) Paul Fodor (CS Stony Brook) Standard ML The basic cycle of SML activity has three parts: read input from the user, evaluate it, print the computed value (or an error message). 4 (c) Paul Fodor (CS Stony Brook) First SML example SML prompt: - Simple example: - 3; val it = 3 : int The first line contains the SML prompt, followed by an expression typed in by the user and ended by a semicolon. The second line is SML’s response, indicating the value of the input expression and its type. 5 (c) Paul Fodor (CS Stony Brook) Interacting with SML SML has a number of built-in operators and data types. it provides the standard arithmetic operators - 3+2; val it = 5 : int The Boolean values true and false are available, as are logical operators such as not (negation), andalso (conjunction), and orelse (disjunction).
    [Show full text]