Skip to main content

Search

Show all results for

Home

Publication

A Monometallic Iron(I) Organoferrate

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Xile Hu, Matthew Wodrich, Fedor Zhurkin
2017

Abstract

Tetra-n-butylammonium (TBA) (eta(6)-biphenyl)diphenyfferrate was formed unexpectedly in the reaction of (TBA)(2)[Fe4S4Cl4] with an excess of phenyllithium. This complex belongs to a novel type of organoferrate.

Official source

https://infoscience.epfl.ch/entities/publication/bfca369d-d03d-4f9e-993b-0d11577fcf41

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (20)

Related concepts (14)

In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type (for example, integer, floating point, string) to every "term" (a word, phrase, or other set of symbols). Usually the terms are various constructs of a computer program, such as variables, expressions, functions, or modules. A type system dictates the operations that can be performed on a term. For variables, the type system determines the allowed values of that term.

In mathematics, logic, and computer science, a type theory is the formal presentation of a specific type system, and in general, type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of mathematics. Two influential type theories that were proposed as foundations are Alonzo Church's typed λ-calculus and Per Martin-Löf's intuitionistic type theory. Most computerized proof-writing systems use a type theory for their foundation, a common one is Thierry Coquand's Calculus of Inductive Constructions.

In computer science, type safety and type soundness are the extent to which a programming language discourages or prevents type errors. Type safety is sometimes alternatively considered to be a property of facilities of a computer language; that is, some facilities are type-safe and their usage will not result in type errors, while other facilities in the same language may be type-unsafe and a program using them may encounter type errors.

Multimodal transcriptomic atlases of mouse spinal cord injury

Matthieu Pierre Gautier

A spinal cord injury (SCI) triggers a cascade of molecular and cellular responses involving inflammatory cell infiltration and cytokine release, apoptosis, demyelination, excitotoxicity, ischemia, and the formation of a fibrotic scar surrounded by an astro ...

EPFL2024

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism

Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki

Type inference in the presence of first-class or "impredicative" second-order polymorphism a la System F has been an active research area for several decades, with original works dating back to the end of the 80s. Yet, until now many basic problems remain ...

Assoc Computing Machinery2024

Between the Pattern and the Type: A short parallel story

Vasileios Chanis

Historically speaking, the notion of the type was reintroduced to the larger architectural discourse as a direct consequence of the crisis of the Modern. The task of revisiting the forms of the past also dictated the return of architectural methods that ha ...

2023