
	Where results make sense

Topic: SML programming language

Related Topics

ML programming language

Timeline of programming languages

Pascal programming language

C programming language

Haskell programming language

GNU Debugger

Project Xanadu

Topics in cryptography

Aurora (planet)

Playfair cipher

Persistence of Time

Avvakum

YBCO

Mitsubishi Motors

List of cryptography topics

	The SML.NET compiler
		SML.NET is a compiler for the functional programming language Standard ML that targets the.NET Common Language Runtime and which supports language interoperability features for easy access to.NET libraries.
		SML.NET extends the SML language to support safe, convenient use of the.NET Framework libraries and code written in other languages for the CLR, such as C# or VB.
		For programs that make no use of the language extensions it is possible to develop and test them using a compiler such as Moscow ML or Standard ML of New Jersey and then to use SML.NET to produce final executables.
	www.cl.cam.ac.uk /Research/TSG/SMLNET (641 words)

	Programming Principles and Tools
		Languages such as OCaml and Standard ML provide excellent general purpose programming languages suited to medium-advanced programmers who want simple yet highly expressive tools that boost their productivity, primarily by reducing the error rate, increasing their productivity through type inference, and basically letting them focus on the difficult parts of their applications.
		The language presents a simple and powerful model of concurrency which is applicable both to multithreaded applications running on a single machine and to the orchestration of asynchronous, event-based applications communicating over a wide area network.
		We define and study a query language for semistructured data that is based on the ambient logic, and we describe an execution model for this language.
	research.microsoft.com /research/ppt (2651 words)

	SAL- Programming - Languages & Compilers
		While the first generation of high-level programming languages, such as Fortran, are still in wide use and evolving, many new languages with higher level abstration capability are emerging.
		Scheme -- a high-level language and is a dialect of Lisp.
		Soar -- a cognitive architectural framework and mode ls, and an AI programming language.
	www.sai.msu.su /sal/F/1 (2421 words)

	MlLanguage - The Fellowship of Hobbyist Programmers
		The two main dialects in use today are Standard ML, a mathematically defined version of the language formulated in part by some of the original language developers; and OCaml, an offshoot version from the original ML to which features are added at will without defining them in a standard.
		SML takes advantage of the availability of a garbage collector to allow you to write complicated expressions that perform several memory allocations without your needing to worry about the details.
		SML also has records, which are similar to tuples but have names for each of their elements instead of numbered positions.
	www.hprog.org /fhp/MlLanguage (2658 words)

	php-deluxe.net - description Funarg problem
		Funarg is an abbreviation for functional argument ; in computer science, the funarg problem relates to the difficulty of implementing function (programming)s as first-class citizen objects in stack (computing)-based programming language implementations.
		For example, the Pascal programming language allows functions to be passed as arguments but not returned as results; thus implementations of Pascal are required to address the downwards funarg problem but not the upwards one.
		The C programming language avoids the main difficulty of the funarg problem by not allowing function definitions to be nested; because the environment of every function is the same, containing just the statically-allocated global variables and functions, a pointer to a function s code describes the function completely.
	www.php-deluxe.net /encyclopedia,index.page,Funarg-problem.htm (389 words)

	Exception handling . Ocaml . Python programming language . Stack (computing) . Objective-C . Microsoft Windows . Crash ... (Site not responding. Last check: )
		In those languages or environments the advent of a condition a "generalisation of an [exception]" according to Kent Pitman implies a function call, and only late in the exception handler the decision to unwind the stack may be taken.
		A crash in computing is a condition where a program either an application or part of the operating system stops performing its expected function and also stops responding to other parts of...
		The SML programming language is a modern descendant of the ML programming language ML programming language used in the LCF theorem prover LCF theorem-proving project.
	www.uk.fraquisanto.net /Exception_handling (549 words)

	EETimes.com - Inside network programming with SML
		Most network-programming languages focus on setting rules and constraints for packet headers, and, as a result, provide a bottom-up approach in which a set of constraints is defined for each packet.
		Rather, a programming language in which code is used to parse message exchanges with application-level awareness, regardless of how payloads were divided into packets, is necessary for even basic levels of traffic analysis sophistication.
		SML code is executed in the context of a flow and concerns itself with the traffic stream rather than requiring logical code for each individual packet.
	www.eetimes.com /story/OEG20030818S0077 (1394 words)

	Fxt - A Transformation Tool for XML Documents
		Also, the document querying and specification language DSSSL [ISO96] originally has been designed as a superset of Lisp: partly because there was an ISO standard of this language, but mainly because of the need of specifying transformations of documents in a way which can be understood without referring to some operational semantics.
		The choice of the implementation language is justified by the fact that SML is known to be good at tree processing in general, which is to what XML processing mainly reduces, as XML documents are conceptually textual representations of trees.
		A language using the DTDs-to-types approach is XMLambda [MS00], a small functional language which has XML documents as its basic data-types.
	www.idealliance.org /papers/xml2001/papers/html/05-03-05.html (5626 words)

	Standard ML (Site not responding. Last check: )
		Programmers in compile-time type-checked languages get the benefit not only of faster execution but also less debugging: many of the programmer's mistakes can be caught early in the development process; and the types may lead to clearer thinking about the program's specification.
		The ML language is clearly specified by The Definition of Standard ML (Revised) (Milner, Tofte, Harper, MacQueen, MIT Press, 1997), which defines the language in 93 pages of mathematical notation and English prose.
		A consequence of having the language definition in a formal notation is that one can prove important properties of the language, such as deterministic evaluation or soundness of type-checking.
	www.smlnj.org /sml.html (778 words)

	Text Based Table of Contents for SML Web Site
		SML provide the migration as a fixed price service, it is charged on a price per line of code plus consultancy required to customise the migration engine for customer specifics.
		SML believes that 2006 will be the year for corporate migrations as CIOs realise the benefits of getting rid of costly and complex core systems.
		SML is the crucial piece of the migration jigsaw; shining a light into the dark depths of Assembler code and converting it into something useable, in a measurable, iterative process, without having to shut down the system or rebuild it from scratch.
	www.smltd.com /faqs.htm (1079 words)

	SML programming language
		The SML programming language is a modern descendant of the ML programming language used in the LCF theorem-proving project.
		It is unique among widely used languages in that it has a formal specification, given as an operational semantics in The Definition of Standard ML.
		MLton is a whole-program compiler, meaning that it compiles the entire program at once.
	www.xasa.com /wiki/en/wikipedia/s/sm/sml_programming_language.html (229 words)

	Computer Science 206
		Study of some standard and non-standard components of several programming languages, focussing on the intuitive semantics of these language pieces.
		Class discussion of issues such as "Why some languages survive, and others don't", and "Which language concepts, and combinations of concepts lead to inefficient execution of programs".
		Homework problems, involving the programming concepts discussed, and writing programs to demonstrate knowledge of the use of these concepts.
	www.cs.duke.edu /~raw/cps206/206.html (226 words)

	PHONE-SOFT INTERNET DIRECTORY INTERNATIONAL:ML
		Project work: theoretical studies of languages and their traits, developing new compiler and run-time technology, empirical studies of applying advanced language techniques to real-world programming problems, more so in areas of high-performance networks and OSs.
		Programming in Standard ML - These notes are intended as a brief introduction to Standard ML (1997 dialect) for the experienced programmer
		Programming in Standard ML 97 - An on-line tutorial by Stephen Gilmore.
	www.phs2.net /cwi/L3/oc116i.htm (417 words)

	Ml
		Historically, ML stands for ''metalanguage'' as it was conceived to develop proof tactics in the LCF theorem prover (the language of which ML was the metalanguage is ''pplambda'', a combination of the first-order predicate calculus and the simply-typed Polymorphism (computer science)polymorphic lambda-calculus).
		Among functional programming languages, it is most well-known for its use of the Hindley-Milner type inference algorithm, which can infer almost all types without annotation.
		ML is often referred to as an '''impure''' functional language, because it permits imperative programming, and therefore, side-effect (computer science)side-effects, unlike purely functional programming languages such as Haskell programming languageHaskell.
	www.looked.com /Topicdetails.aspx?Topicid=15206&name=&catid=352&topicname=ML_programming_language (238 words)

	Sml Language
		Standard ML (or SML for short) is a modern dialect of ML [MlLanguage].
		A function of no arguments is impossible in SML: Attempting to call a function without any arguments gets you the value of that function, just as calling a function with 'too few' arguments creates an anonymous function that will take the arguments you did not specify.
		The solution is unit, which is how SML programmers tell each other (and their compilers) that this function either takes no real arguments or returns no real value.
	c2.com /cgi/wiki?SmlLanguage (892 words)

	Programming language concepts
		Computer Science 302 deals with programming languages generally, considered as formal, executable notations for expressing algorithms: their syntactic structures, the ``virtual machines'' or models of computation that they implicitly rely on, the data values and structures that they support, and the semantics of the various constructions from which programs are built.
		The textbooks for the course are Essentials of programming languages, second edition, by Daniel P. Friedman, Mitchell Wand, and Christopher T. Haynes (Cambridge, Massachusetts: The MIT Press, 2000), ISBN 0-262-06217-8, and Concepts in programming languages, by John Mitchell (Cambridge, United Kingdom: Cambridge University Press, 2003), ISBN 0-521-78098-5.
		All of the Scheme code presented in Essentials of programming languages is available on line, along with several customization files to adapt various Scheme implementations to the dialect used in the book.
	www.math.grin.edu /~stone/courses/languages (1114 words)

	A synopsis of the SML programming language (Site not responding. Last check: )
		Someone completely unfamiliar with SML or functional languages can look at SML, Part I to learn about function objects, let expressions and simple SML data types for integers, boolean values and tuples.
		Someone beginning to write simple SML programs will find in SML, Part II a description of the interaction with the SML compiler, patterns, the remaining primitive datatypes, and simple user-defined datatypes.
		After the main ideas are clear, SML, Part III is appropriate for examples of more advanced constructs like records and exception handling.
	www.cs.fit.edu /~ryan/sml/sml.html (175 words)

	Programming Language Design (Site not responding. Last check: )
		CSC 351 Programming Languages I: Design (3) Comparison of structure and semantics of various high level programming languages.
		Language design issues and techniques, including parameter passing, storage allocation and mapping and binding time.
		The emphasis of this course is not on learning a particular language, or set of languages, but on the process of learning to learn new programming languages.
	www.csc.calpoly.edu /~jlbeug/351 (129 words)

	Learn more about SML programming language in the online encyclopedia. (Site not responding. Last check: )
		Learn more about SML programming language in the online encyclopedia.
		It is unique among widely used languages in that it has a formal specification, given as an operational semantics in The definition of Standard ML (Revised), by Milner, Tofte, Harper and MacQueen (ISBN 0262631814).
		MLton is a full-program compiler, meaning that it compiles all of a program at once.
	www.onlineencyclopedia.org /s/sm/sml_programming_language.html (242 words)

	Comp.Lang.ML FAQ [Monthly Posting]
		It aims to be * an accurate reference implementation of the language specification, * a platform for experimentation with the language semantics or extensions to it, * a useful tool for educational purposes.
		Some EML specifications are executable, making EML a "wide-spectrum" language which can be used to express every stage in the development of a SML program from the initial high-level specification to the final program itself and including intermediate stages in which specification and program are intermingled.
		The basic idea is that when a variable is bound to a polymorphic expression, it must be the case that the expression is tantamount to a value: that is, that it is guaranteed not to raise an exception or allocate memory.
	www.faqs.org /faqs/meta-lang-faq (4921 words)

	Compilers, SDKs, and Tools
		Active Oberon is an interpretation of the programming language Oberon in the context of the new Microsoft.NET technology.
		Mercury is a new logic/functional programming language, which combines the clarity and expressiveness of declarative programming with advanced static analysis and error detection features.
		Standard ML is a safe, modular, strict, functional, polymorphic programming language with compile-time type checking and type inference, garbage collection, exception handling, immutable data types and updateable references, abstract data types, and parametric modules.
	docs.msdnaa.net /ark_new/Webfiles/languages.htm (2301 words)

	Components and Types
		More generally, the "programming language of components" is a functional language whose values are structures and whose types are signatures.
		An interpreter for a statically typed programming language requires at least two kinds of environments: one for mapping variables to run-time values and another one for mapping type variables to types.
		More generally, we might wish to program with components in a language that is pretty much a full-fledged programming language, perhaps even core ML itself.
	www.ccs.neu.edu /home/matthias/Tmp/SML/index.html (3530 words)

	Programming Languages ITU F2005
		This course introduces programming language concepts and tools, such as interpreters, compilers, grammars, parsers, parser generators, abstract machines, type checking, etc. We shall model imperative, functional, and object-oriented programming languages by means of interpreters and simple compilers.
		We shall use Standard ML (SML) as a meta-language: the language we use to describe other languages, and the language in which we implement interpreters and compilers.
		Peter Sestoft's lecture notes Programming Language Concepts (PLC), KVL and ITU 2005, which are used to present concepts of abstract syntax, dynamic and static semantics, interpreters, virtual machines, compilers, compilation, byte code, reflection, and runtime code generation.
	www.itu.dk /courses/PFOO/F2005 (672 words)

Try your search on: Qwika (all wikis)