XML.orgXML.org
FOCUS AREAS |XML-DEV |XML.org DAILY NEWSLINK |REGISTRY |RESOURCES |ABOUT
OASIS Mailing List ArchivesView the OASIS mailing list archive below
or browse/search using MarkMail.

 


Help: OASIS Mailing Lists Help | MarkMail Help

[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]
Is there a formal basis for XML? For XML Schema?

Hi Folks,

It is my understanding that underlying the functional programming languages Haskell, Scala, and XSLT is Lambda Calculus. Those languages are simply a layer of abstraction (syntactic sugar) on top of Lambda expressions. 

The field of Lambda Calculus is formal and rich and enables powerful properties of Lambda expressions to be proven. 

A functional program may be translated to Lambda expressions. Then, Lambda Calculus may be employed to prove powerful properties about the program.

Thus, Lambda Calculus is the formal basis for Haskell, Scala, and XSLT.

Is there a formal basis for XML?

Is there a formal basis for XML Schema?

/Roger



[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]


News | XML in Industry | Calendar | XML Registry
Marketplace | Resources | MyXML.org | Sponsors | Privacy Statement

Copyright 1993-2007 XML.org. This site is hosted by OASIS