FOSSACS 2005 - PDF Preprint Papers

FOSSACS 2005 International Conference on Foundations of Software Science and Computation Structure

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOSSACS-2005 Paper

click to vote

FOSSACS
2005
Springer

175views Software Engineering» more FOSSACS 2005»

A Computational Model for Multi-variable Differential Calculus

13 years 10 months ago

Download www.doc.ic.ac.uk

Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the ﬁrst time gives rise to data types for differentiable functio...

Abbas Edalat, André Lieutier, Dirk Pattinso...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	175	A Computational Model for Multi-variable Differential Calculus	claim
2	165	Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications	claim
3	159	Bridging Language-Based and Process Calculi Security	claim
4	152	Duality for Logics of Transition Systems	claim
5	147	Stochastic Transition Systems for Continuous State Spaces and Non-determinism	claim
6	147	Expressivity of Coalgebraic Modal Logic: The Limits and Beyond	claim
7	139	A Unifying Model of Variables and Names	claim
8	138	Bisimulation on Speed: A Unified Approach	claim
9	135	Congruence for Structural Congruences	claim
10	134	Axiomatizations for Probabilistic Finite-State Behaviors	claim
11	133	Fault Diagnosis Using Timed Automata	claim
12	130	Mathematical Models of Computational and Combinatorial Structures	claim
13	121	Alternating Timed Automata	claim
14	119	From Separation Logic to First-Order Logic	claim
15	119	Third-Order Idealized Algol with Iteration Is Decidable	claim
16	115	Composition and Decomposition in True-Concurrency	claim
17	110	Model Checking for Nominal Calculi	claim
18	109	Free-Algebra Models for the pi-Calculus	claim
19	106	Model Checking Durational Probabilistic Systems	claim
20	104	History-Based Access Control with Local Policies	claim
21	104	Foundations of Web Transactions	claim
22	101	A Simpler Proof Theory for Nominal Logic	claim
23	90	Full Abstraction for Polymorphic Pi-Calculus	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers