Dirk Draheim – författare
550 kr
Skickas inom 10-15 vardagar
687 kr
Läs direkt efter köp
1 125 kr
Skickas inom 10-15 vardagar
1 367 kr
Läs direkt efter köp
Form-based applications range from simple web shops to complex enterprise resource planning systems. Draheim and Weber adapt well-established basic modeling techniques in a novel way to achieve a modeling framework optimized for this broad application domain. They introduce new modeling artifacts, such as page diagrams and form storyboards, and separate dialogue patterns to allow for reuse. In their implementation they have developed new constructs such as typed server pages, and tools for forward and reverse engineering of presentation layers. The methodology is explained using an online bookshop as a running example in which the user can experience the modeling concepts in action.
The combination of theoretical achievements and hands-on practical advice and tools makes this book a reference work for both researchers in the areas of software architectures and submit-response style user interfaces, and professionals designing and developing such applications. More information and additional material is also available online.
566 kr
Skickas inom 10-15 vardagar
708 kr
Läs direkt efter köp
566 kr
Skickas inom 10-15 vardagar
708 kr
Läs direkt efter köp
566 kr
Skickas inom 10-15 vardagar
734 kr
Läs direkt efter köp
1 125 kr
Skickas inom 10-15 vardagar
1 268 kr
Kommande
566 kr
Skickas inom 10-15 vardagar
1 349 kr
Skickas inom 10-15 vardagar
1 672 kr
Läs direkt efter köp
This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice.
The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributionsas domains.
The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.
1 308 kr
Skickas inom 10-15 vardagar