Writing Proofs in Analysis [[electronic resource] /] / by Jonathan M. Kane |
Autore | Kane Jonathan M |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XX, 347 p. 79 illus., 4 illus. in color.) |
Disciplina | 511.36 |
Soggetto topico |
Functional analysis
Fourier analysis Mathematical logic Functional Analysis Fourier Analysis Mathematical Logic and Foundations |
ISBN | 3-319-30967-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | What Are Proofs, And Why Do We Write Them? -- The Basics of Proofs -- Limits -- Continuity -- Derivatives -- Riemann Integrals -- Infinite Series -- Sequences of Functions -- Topology of the Real Line -- Metric Spaces . |
Record Nr. | UNINA-9910254074303321 |
Kane Jonathan M | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
ZB 2002: Formal Specification and Development in Z and B [[electronic resource] ] : 2nd International Conference of B and Z Users Grenoble, France, January 23-25, 2002, Proceedings / / edited by Didier Bert, Jonathan P. Bowen, Martin C. Henson, Ken Robinson |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XI, 541 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Programming languages (Electronic computers) Mathematical logic Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Software Engineering Mathematical Logic and Formal Languages |
ISBN | 3-540-45648-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Theories, Implementations, and Transformations -- Incremental Proof of the Producer/Consumer Property for the PCI Protocol -- Controlling Control Systems: An Application of Evolving Retrenchment -- Checking Z Data Refinements Using an Animation Tool -- Encoding Object-Z in Isabelle/HOL -- Characters + Mark-up = Z Lexis -- Extraction of Abstraction Invariants for Data Refinement -- An Approach to Combining B and Alloy -- Software Construction by Stepwise Feature Introduction -- The Semantics of Circus -- Handling Inconsistencies in Z Using Quasi-Classical Logic -- Loose Specification and Refinement in Z -- On Using Conditional Definitions in Formal Theories -- A Theory of Generalised Substitutions -- Reinforced Condition/Decision Coverage (RC/DC): A New Criterion for Software Testing -- A Comparison of the BTT and TTF Test-Generation Methods -- A Formal Analysis of the CORBA Security Service -- Type Synthesis in B and the Translation of B to PVS -- “Higher-Order” Mathematics in B -- ABS Project: Merging the Best Practices in Software Design from Railway and Aircraft Industries -- Generalised Substitution Language and Differentials -- Communicating B Machines -- Synchronized Parallel Composition of Event Systems in B -- Global and Communicating State Machine Models in Event Driven B: A Simple Railway Case Study -- Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions -- A Formal Model of the UML Metamodel: The UML State Machine and Its Integrity Constraints -- Coming and Going from UML to B: A Proposal to Support Traceability in Rigorous IS Development. |
Record Nr. | UNINA-9910143916603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
ZB 2002: Formal Specification and Development in Z and B [[electronic resource] ] : 2nd International Conference of B and Z Users Grenoble, France, January 23-25, 2002, Proceedings / / edited by Didier Bert, Jonathan P. Bowen, Martin C. Henson, Ken Robinson |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XI, 541 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Programming languages (Electronic computers) Mathematical logic Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Software Engineering Mathematical Logic and Formal Languages |
ISBN | 3-540-45648-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Theories, Implementations, and Transformations -- Incremental Proof of the Producer/Consumer Property for the PCI Protocol -- Controlling Control Systems: An Application of Evolving Retrenchment -- Checking Z Data Refinements Using an Animation Tool -- Encoding Object-Z in Isabelle/HOL -- Characters + Mark-up = Z Lexis -- Extraction of Abstraction Invariants for Data Refinement -- An Approach to Combining B and Alloy -- Software Construction by Stepwise Feature Introduction -- The Semantics of Circus -- Handling Inconsistencies in Z Using Quasi-Classical Logic -- Loose Specification and Refinement in Z -- On Using Conditional Definitions in Formal Theories -- A Theory of Generalised Substitutions -- Reinforced Condition/Decision Coverage (RC/DC): A New Criterion for Software Testing -- A Comparison of the BTT and TTF Test-Generation Methods -- A Formal Analysis of the CORBA Security Service -- Type Synthesis in B and the Translation of B to PVS -- “Higher-Order” Mathematics in B -- ABS Project: Merging the Best Practices in Software Design from Railway and Aircraft Industries -- Generalised Substitution Language and Differentials -- Communicating B Machines -- Synchronized Parallel Composition of Event Systems in B -- Global and Communicating State Machine Models in Event Driven B: A Simple Railway Case Study -- Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions -- A Formal Model of the UML Metamodel: The UML State Machine and Its Integrity Constraints -- Coming and Going from UML to B: A Proposal to Support Traceability in Rigorous IS Development. |
Record Nr. | UNISA-996465551903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
λ-Calculus and Computer Science Theory [[electronic resource] ] : Proceedings of the Symposium Held in Rome March 25–27, 1975. IAC - CNR Istituto per le Applicazioni del Calcolo “Mauro Picone” of the Consiglio Nazionale delle Ricerche / / edited by C. Böhm |
Edizione | [1st ed. 1975.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1975 |
Descrizione fisica | 1 online resource (XII, 371 p. 1 illus.) |
Disciplina | 005.131 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical logic
Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
ISBN | 3-540-37944-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Combinators and classes -- Least fixed points revisited -- Infinite normal forms for the ?-calculus -- A survey of some useful partial order relations on terms of the lambda calculus -- ?-Terms as total or partial functions on normal forms -- Continuous semantics and inside-out reductions -- An algebraic interpretation of the ??K-calculus and a labelled ?-calculus -- Les modeles informatiques des ?-calculs -- On the description of time varying systems in ?-calculus -- Unification in typed lambda calculus -- A condition for identifying two elements of whatever model of combinatory logic -- Typed meaning in Scott's ?-calculus models -- Programming language semantics in a typed lambda-calculus -- Big trees in a ?-calculus with ?-expressions as types -- Normed uniformly reflexive structures -- A model with nondeterministic computation -- On subrecursiveness in weak combinatory logic -- Sequentially and parallelly computable functionals -- Computation on arbitrary algebras -- On solvability by ?I-terms -- Some philosophical issues concerning theories of combinators -- Open problems. |
Record Nr. | UNISA-996465403903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1975 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|