Data/hora: 10/06/2024 00:54:25

Biblioteca(s): 	Embrapa Agricultura Digital.	
Data corrente: 	10/09/1996	
Data da última atualização: 	18/12/2007	
Autoria: 	STOY, J. E.	
Título: 	Mathematical foundations.	
Ano de publicação: 	1982	
Fonte/Imprenta: 	In: BJORNER, D.; JONES, C. B. Formal specification and software development. Englewood Cliffs: Prentice-Hall International, 1982.	
Páginas: 	p.47-81.	
Idioma: 	Inglês	
Conteúdo: 	The need to be sure that the semantics of a language are precisely under-stood applies to the meta-language. Indeed, if the meta-language is not adequatwely defined, all attempts to employ it may be wasted. Chapter 2 uses some extremely powerful concepts. In particular, recursive functions defined in lambda notation and the self-application of functions need detailed mathematical foundations were, in fact, lacking when Christopher Strachey and Peter Landin first used lambda notation to define programming languages. The mathematical problems were first solved by Dana Scott. Scott has gone on to offer several mathematical models: the treatment here gives an outline of the recent "neighborhood" approach. A pedagogic treatment of the general problem can be found in [Stoy 77a]. Readers who are less interested in mathematics than their use in defining semantics, might choose to omite reading this chapter. If they are concerned with defining systems where there is no recursion, this could be done quite safely. Readers involved in the definition of programming languages should, however, be aware of the problems involved and are recomended to read at least the first two sections. 	
Categoria do assunto: 	--	
Registro original: 	Embrapa Agricultura Digital (CNPTIA)	
Exemplares: 	CNPTIA - (4096-1) - ADD - PL - -- - 005.1 - BJO - 1986.00333 - DIS