@conference {14702,
	title = {Lightweight monadic programming in ML},
	booktitle = {Proceedings of the 16th ACM SIGPLAN international conference on Functional programming},
	series = {ICFP {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {15 - 27},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Many useful programming constructions can be expressed as monads. Examples include probabilistic modeling, functional reactive programming, parsing, and information flow tracking, not to mention effectful functionality like state and I/O. In this paper, we present a type-based rewriting algorithm to make programming with arbitrary monads as easy as using ML{\textquoteright}s built-in support for state and I/O. Developers write programs using monadic values of type m τ as if they were of type τ, and our algorithm inserts the necessary binds, units, and monad-to-monad morphisms so that the program type checks. Our algorithm, based on Jones{\textquoteright} qualified types, produces principal types. But principal types are sometimes problematic: the program{\textquoteright}s semantics could depend on the choice of instantiation when more than one instantiation is valid. In such situations we are able to simplify the types to remove any ambiguity but without adversely affecting typability; thus we can accept strictly more programs. Moreover, we have proved that this simplification is efficient (linear in the number of constraints) and coherent: while our algorithm induces a particular rewriting, all related rewritings will have the same semantics. We have implemented our approach for a core functional language and applied it successfully to simple examples from the domains listed above, which are used as illustrations throughout the paper.},
	keywords = {coercion, coherence, monad, rewriting, type},
	isbn = {978-1-4503-0865-6},
	doi = {10.1145/2034773.2034778},
	url = {http://doi.acm.org/10.1145/2034773.2034778},
	author = {Swamy,Nikhil and Guts,Nataliya and Leijen,Daan and Hicks, Michael W.}
}
@conference {14054,
	title = {A boundary element method for electromagnetic scattering by multiple cylinders},
	booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE},
	volume = {3},
	year = {2003},
	month = {2003/06//},
	pages = {516 - 519 vol.3 - 516 - 519 vol.3},
	abstract = {An integral equation approach is derived for an electromagnetic scattering from M multiple cylinders. The problem is two-dimensional and the integral equation is solved using the Nystrom method. We give numerical examples that illustrate the algorithm.},
	keywords = {algorithm;, boundary, boundary-elements, cylinders;, electromagnetic, element, equations;, Fredholm, integral, method;, methods;, multiple, Nystrom, scattering;, two-dimensional, type, wave},
	doi = {10.1109/APS.2003.1219899},
	author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.}
}
@article {15406,
	title = {Switching as an exit problem},
	journal = {Magnetics, IEEE Transactions on},
	volume = {31},
	year = {1995},
	month = {1995/11//},
	pages = {3545 - 3547},
	abstract = {Previously, it has been shown that Preisach type models driven by stochastic inputs can be employed to model aftereffect. In this model, the machinery of the ldquo;exit problem rdquo; is instrumental in computing the time evolutions of the expected value and the distributions of switching times. Here, for the first time, we present numerical simulation results of the aforementioned viscosity models and demonstrate that these models can be employed to compute switching times and time evolutions of the expected value of magnetization},
	keywords = {aftereffect;magnetic, aftereffect;stochastic, analysis;, distribution;viscosity, force;fluctuations;magnetic, hysteresis;magnetic, inputs;switching, models;coercive, models;exit, Preisach, problem;expected, switching;numerical, times, type, value;magnetization;model},
	isbn = {0018-9464},
	doi = {10.1109/20.489564},
	author = {Korman,C.E. and Mayergoyz, Issak D}
}
