Dipole-induced conductivity enhancement by n-type inclusion in a p-type system: α-Fe2O3–PEDOT:PSS nanocomposites

2014 ◽  
Vol 16 (29) ◽  
pp. 15597-15607 ◽  
Author(s):  
R. Raccis ◽  
L. Wortmann ◽  
S. Ilyas ◽  
J. Schläfer ◽  
A. Mettenbörger ◽  
...  
Keyword(s):  
Type System ◽  
Type Systems ◽  
Conductivity Enhancement ◽  
Type Phase ◽  
Novel Method ◽  
P Type ◽  
Type Inclusion

A novel method is presented for conductivity enhancement in p-type systems via the inclusion of an n-type phase.

scholarly journals Automatic amortized resource analysis with the Quantum physicist’s method

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-29
Author(s):  
David M. Kahn ◽  
Jan Hoffmann
Keyword(s):  
Quantum Tunneling ◽  
State Of The Art ◽  
Type System ◽  
Type Systems ◽  
Quantum Superposition ◽  
Resource Analysis ◽  
Linear Type ◽  
New Type ◽  
Novel Method ◽  
Standard Library

We present a novel method for working with the physicist's method of amortized resource analysis, which we call the quantum physicist's method. These principles allow for more precise analyses of resources that are not monotonically consumed, like stack. This method takes its name from its two major features, worldviews and resource tunneling, which behave analogously to quantum superposition and quantum tunneling. We use the quantum physicist's method to extend the Automatic Amortized Resource Analysis (AARA) type system, enabling the derivation of resource bounds based on tree depth. In doing so, we also introduce remainder contexts, which aid bookkeeping in linear type systems. We then evaluate this new type system's performance by bounding stack use of functions in the Set module of OCaml's standard library. Compared to state-of-the-art implementations of AARA, our new system derives tighter bounds with only moderate overhead.

scholarly journals Band degeneracy enhanced thermoelectric performance in layered oxyselenides by first-principles calculations

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Ning Wang ◽  
Menglu Li ◽  
Haiyan Xiao ◽  
Zhibin Gao ◽  
Zijiang Liu ◽  
...  
Keyword(s):  
Density Functional ◽  
Transport Theory ◽  
Relaxation Times ◽  
Wide Band ◽  
Type Systems ◽  
Model Systems ◽  
Boltzmann Transport ◽  
Seebeck Coefficients ◽  
Boltzmann Transport Theory ◽  
P Type

AbstractBand degeneracy is effective in optimizing the power factors of thermoelectric (TE) materials by enhancing the Seebeck coefficients. In this study, we demonstrate this effect in model systems of layered oxyselenide family by the density functional theory (DFT) combined with semi-classical Boltzmann transport theory. TE transport performance of layered LaCuOSe and BiCuOSe are fully compared. The results show that due to the larger electrical conductivities caused by longer electron relaxation times, the n-type systems show better TE performance than p-type systems for both LaCuOSe and BiCuOSe. Besides, the conduction band degeneracy of LaCuOSe leads to a larger Seebeck coefficient and a higher optimal carrier concentration than n-type BiCuOSe, and thus a higher power factor. The optimal figure of merit (ZT) value of 1.46 for n-type LaCuOSe is 22% larger than that of 1.2 for n-type BiCuOSe. This study highlights the potential of wide band gap material LaCuOSe for highly efficient TE applications, and demonstrates that inducing band degeneracy by cations substitution is an effective way to enhance the TE performance of layered oxyselenides.

A system of constructor classes: overloading and implicit higher-order polymorphism

1995 ◽  
Vol 5 (1) ◽  
pp. 1-35 ◽  
Author(s):  
Mark P. Jones
Keyword(s):  
Type System ◽  
Type Systems ◽  
Natural Generalization ◽  
Higher Order ◽  
Functional Language ◽  
Effective Algorithm ◽  
Prototype Implementation ◽  
Type Classes

AbstractThis paper describes a flexible type system that combines overloading and higher-order polymorphism in an implicitly typed language using a system of constructor classes—a natural generalization of type classes in Haskell. We present a range of examples to demonstrate the usefulness of such a system. In particular, we show how constructor classes can be used to support the use of monads in a functional language. The underlying type system permits higher-order polymorphism but retains many of the attractive features that have made Hindley/Milner type systems so popular. In particular, there is an effective algorithm that can be used to calculate principal types without the need for explicit type or kind annotations. A prototype implementation has been developed providing, amongst other things, the first concrete implementation of monad comprehensions known to us at the time of writing.

scholarly journals Automating Proof Steps of Progress Proofs: Comparing Vampire and Dafny

10.29007/5zjp ◽  
2018 ◽  
Author(s):  
Sylvia Grewe ◽  
Sebastian Erdweg ◽  
Mira Mezini
Keyword(s):  
Formal Methods ◽  
Programming Language ◽  
Type System ◽  
Type Systems ◽  
Domain Specific Languages ◽  
Smt Solver ◽  
Domain Specific ◽  
Efficient Type

\noindent Developing provably sound type systems is a non-trivial task which, as of today, typically requires expert skills in formal methods and a considerable amount of time. Our Veritas~\cite{GreweErdwegWittmannMezini15} project aims at providing support for the development of soundness proofs of type systems and efficient type checker implementations from specifications of type systems. To this end, we investigate how to best automate typical steps within type soundness proofs.\noindent In this paper, we focus on progress proofs for type systems of domain-specific languages. As a running example for such a type system, we model a subset SQL and augment it with a type system. We compare two different approaches for automating proof steps of the progress proofs for this type system against each other: firstly, our own tool Veritas, which translates proof goals and specifications automatically to TPTP~\cite{Sutcliffe98} and calls Vampire~\cite{KovacsV13} on them, and secondly, the programming language Dafny~\cite{Leino2010}, which translates proof goals and specifications to the intermediate verification language Boogie 2~\cite{Leino2008} and calls the SMT solver Z3~\cite{DeMoura2008} on them. We find that Vampire and Dafny are equally well-suited for automatically proving simple steps within progress proofs.

How to evaluate the performance of gradual type systems

2019 ◽  
Vol 29 ◽  
Author(s):  
BEN GREENMAN ◽  
ASUMU TAKIKAWA ◽  
MAX S. NEW ◽  
DANIEL FELTEY ◽  
ROBERT BRUCE FINDLER ◽  
...  
Keyword(s):  
Type System ◽  
Type Systems ◽  
Relative Performance ◽  
Systematic Evaluation ◽  
Gradual Typing ◽  
The Absolute

Abstract A sound gradual type system ensures that untyped components of a program can never break the guarantees of statically typed components. This assurance relies on runtime checks, which in turn impose performance overhead in proportion to the frequency and nature of interaction between typed and untyped components. The literature on gradual typing lacks rigorous descriptions of methods for measuring the performance of gradual type systems. This gap has consequences for the implementors of gradual type systems and developers who use such systems. Without systematic evaluation of mixed-typed programs, implementors cannot precisely determine how improvements to a gradual type system affect performance. Developers cannot predict whether adding types to part of a program will significantly degrade (or improve) its performance. This paper presents the first method for evaluating the performance of sound gradual type systems. The method quantifies both the absolute performance of a gradual type system and the relative performance of two implementations of the same gradual type system. To validate the method, the paper reports on its application to 20 programs and 3 implementations of Typed Racket.

scholarly journals Planets in Binaries: Formation and Dynamical Evolution

Galaxies ◽  
2019 ◽  
Vol 7 (4) ◽  
pp. 84 ◽  
Author(s):  
Francesco Marzari ◽  
Philippe Thebault
Keyword(s):  
Binary Systems ◽  
Planet Formation ◽  
Dynamical Evolution ◽  
Type Systems ◽  
Hyperbolic Orbit ◽  
Companion Star ◽  
Mean Motion Resonances ◽  
Disk Formation ◽  
P Type ◽  
Two Populations

Binary systems are very common among field stars, yet the vast majority of known exoplanets have been detected around single stars. While this relatively small number of planets in binaries is probably partly due to strong observational biases, there is, however, statistical evidence that planets are indeed less frequent in binaries with separations smaller than 100 au, strongly suggesting that the presence of a close-in companion star has an adverse effect on planet formation. It is indeed possible for the gravitational pull of the second star to affect all the different stages of planet formation, from proto-planetary disk formation to dust accumulation into planetesimals, to the accretion of these planetesimals into large planetary embryos and, eventually, the final growth of these embryos into planets. For the crucial planetesimal-accretion phase, the complex coupling between dynamical perturbations from the binary and friction due to gas in the proto-planetary disk suggests that planetesimal accretion might be hampered due to increased, accretion-hostile impact velocities. Likewise, the interplay between the binary’s secular perturbations and mean motion resonances lead to unstable regions, where not only planet formation is inhibited, but where a massive body would be ejected from the system on a hyperbolic orbit. The amplitude of these two main effects is different for S- and P-type planets, so that a comparison between the two populations might outline the influence of the companion star on the planet formation process. Unfortunately, at present the two populations (circumstellar or circumbinary) are not known equally well and different biases and uncertainties prevent a quantitative comparison. We also highlight the long-term dynamical evolution of both S and P-type systems and focus on how these different evolutions influence the final architecture of planetary systems in binaries.

Salt nanoconfinement in zirconium-based metal–organic frameworks leads to pore-size and loading-dependent ionic conductivity enhancement

2020 ◽  
Vol 56 (53) ◽  
pp. 7245-7248
Author(s):  
Sorout Shalini ◽  
Thomas P. Vaid ◽  
Adam J. Matzger
Keyword(s):  
Ionic Conductivity ◽  
Pore Size ◽  
Metal Organic Frameworks ◽  
Significant Enhancement ◽  
Conductivity Enhancement ◽  
Metal Organic ◽  
Novel Method ◽  
Ion Conductors

Confinement of the salt [NEt4][TFSI] in metal–organic frameworks leads to a significant enhancement in ionic conductivity, pointing toward a novel method of creating solid ion conductors.

scholarly journals Pure Type System conversion is always typable

2012 ◽  
Vol 22 (2) ◽  
pp. 153-180 ◽  
Author(s):  
VINCENT SILES ◽  
HUGO HERBELIN
Keyword(s):  
Type System ◽  
Type Systems ◽  
Positive Answer ◽  
General Question ◽  
Pure Type ◽  
Typing System ◽  
Long Time ◽  
Pure Type Systems

AbstractPure Type Systems are usually described in two different ways, one that uses an external notion of computation like beta-reduction, and one that relies on a typed judgment of equality, directly in the typing system. For a long time, the question was open to know whether both presentations described the same theory. A first step towards this equivalence has been made by Adams for a particular class ofPure Type Systems(PTS) called functional. Then, his result has been relaxed to all semi-full PTSs in previous work. In this paper, we finally give a positive answer to the general question, and prove that equivalence holds for any Pure Type System.

Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming

2004 ◽  
Vol 14 (1) ◽  
pp. 1-2
Author(s):  
GILLES BARTHE ◽  
PETER DYBJEN ◽  
PETER THIEMANN
Keyword(s):  
Programming Languages ◽  
Type Theory ◽  
Type System ◽  
Type Systems ◽  
Special Issue ◽  
Dependent Type Theory ◽  
Dependent Type

Modern programming languages rely on advanced type systems that detect errors at compile-time. While the benefits of type systems have long been recognized, there are some areas where the standard systems in programming languages are not expressive enough. Language designers usually trade expressiveness for decidability of the type system. Some interesting programs will always be rejected (despite their semantical soundness) or be assigned uninformative types.

scholarly journals Implicit self-adjusting computation for purely functional programs

2014 ◽  
Vol 24 (1) ◽  
pp. 56-112 ◽  
Author(s):  
YAN CHEN ◽  
JOSHUA DUNFIELD ◽  
MATTHEW A. HAMMER ◽  
UMUT A. ACAR
Keyword(s):  
Programming Languages ◽  
Type System ◽  
Type Systems ◽  
Type Inference ◽  
Source Program ◽  
Target Program ◽  
Implicit Approach ◽  
Asymptotic Complexity ◽  
Cost Semantics ◽  
Output Behavior

AbstractComputational problems that involve dynamic data, such as physics simulations and program development environments, have been an important subject of study in programming languages. Building on this work, recent advances in self-adjusting computation have developed techniques that enable programs to respond automatically and efficiently to dynamic changes in their inputs. Self-adjusting programs have been shown to be efficient for a reasonably broad range of problems, but the approach still requires an explicit programming style, where the programmer must use specific monadic types and primitives to identify, create, and operate on data that can change over time. We describe techniques for automatically translating purely functional programs into self-adjusting programs. In this implicit approach, the programmer need only annotate the (top-level) input types of the programs to be translated. Type inference finds all other types, and a type-directed translation rewrites the source program into an explicitly self-adjusting target program. The type system is related to information-flow type systems and enjoys decidable type inference via constraint solving. We prove that the translation outputs well- typed self-adjusting programs and preserves the source program's input–output behavior, guaranteeing that translated programs respond correctly to all changes to their data. Using a cost semantics, we also prove that the translation preserves the asymptotic complexity of the source program.

Sign in / Sign up

Export Citation Format

Share Document