LEADER 04109nam  22005415  450 
001 996465509403316
005 20200702012552.0
010   $a3-540-38654-8
024 7 $a10.1007/3-540-10699-5
035   $a(CKB)1000000000230110
035   $a(SSID)ssj0000323247
035   $a(PQKBManifestationID)11247869
035   $a(PQKBTitleCode)TC0000323247
035   $a(PQKBWorkID)10296905
035   $a(PQKB)10853229
035   $a(DE-He213)978-3-540-38654-4
035   $a(PPN)155182242
035   $a(EXLCZ)991000000000230110
100   $a20121227d1981      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFormalization of Programming Concepts$b[electronic resource] $eInternational Colloquium, Peniscola, Spain, April 19-25, 1981. Proceedings /$fedited by J. Diaz, I. Ramos
205   $a1st ed. 1981.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1981.
215   $a1 online resource (X, 486 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v107
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-10699-5 
327   $aThe algebra of functional programs: Function level reasoning, linear equations, and extended definitions -- The VDM principles of software specification & program design -- Attribute grammars : Theory and applications -- Compiler generation from formal definition of programming languages : A survey -- Formal behavioural specification of concurrent systems without globality assumptions -- A birkhoff-like theorem for algebraic classes of interpretations of program schemes -- Building data base management systems through formal specification -- Reducing types in applicative languages with structured data -- On the definition of lambda-calculus models -- About data type genericity -- On the algebraic extensions of abstract data types -- Scenarios: A model of non-determinate computation -- An operational semantics for a language with early completion data structures -- Le calcul des fermetures dans les lambda-langages -- Distributed termination with interval assertions -- Algebraic denotational semantics using parameterized abstract modules -- Relational semantics of strongly communicating sequential processes -- A construction of concurrent systems by means of sequential solutions and concurrency relations -- The development of an interpreter by means of abstract algebraic software specifications -- A formal model of an interpreter for nonprocedural languages -- Proof theoretic methodology for propositional dynamic logic -- FP systems in edinburgh LCF -- A proposal for operational semantics and equivalence of finite asynchronous processes -- An extension to horn clause logic allowing the definition of concurrent processes -- A semantic algebra for binding constructs -- On the representation of data types -- An approach to communications and parallelism in applicative languages -- Using least fixed points to characterize formal computations of non-deterministic equations -- Formal representations for recursively defined functional programs -- Petri nets and concurrency-like relations.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v107
606   $aSoftware engineering
606   $aComputer programming
606   $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
615  0$aSoftware engineering.
615  0$aComputer programming.
615 14$aSoftware Engineering/Programming and Operating Systems.
615 24$aProgramming Techniques.
676   $a005.1
702   $aDiaz$b J$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRamos$b I$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465509403316
996   $aFormalization of programming concepts$9878479
997   $aUNISA